Total coloring of planar graphs of maximum degree eight

The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by χ ″ ( G ) . It is known that if a planar graph G has maximum degree Δ ⩾ 9 , then χ ″ ( G ) = Δ + 1 . Recently Hou et al. (Graphs and Combinatorics 24 (20...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 110; číslo 8; s. 321 - 324
Hlavní autori:	Roussel, Nicolas, Zhu, Xuding
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.04.2010 Elsevier Elsevier Sequoia S.A
Predmet:	Algorithmics. Computability. Computer arithmetics Applied sciences Coloring Combinatorial analysis Combinatorial problems Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Graph coloring Graph theory Graphs Information retrieval. Graph Integers Mathematics Miscellaneous Optimization algorithms Planar graphs Sciences and techniques of general use Studies Theoretical computing Total coloring Total coloring Combinatorial problems Planar graphs Vertex Edge(graph) Computer theory Combinatorial problem Planar graph Color Chromatic number Integer Maximum Information processing Graph degree Graph colouring Combinatorics Algorithm analysis
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!