Abstract: The smallest integer needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing and Behzed conjectured that the total coloring can be done using at most colors, where is the maximum degree of . It is not settled even for planar graphs. In this paper we give a survey on total coloring of graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1998288 (Why is no real title available?)
- scientific article; zbMATH DE number 2077682 (Why is no real title available?)
- scientific article; zbMATH DE number 6813611 (Why is no real title available?)
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- scientific article; zbMATH DE number 840689 (Why is no real title available?)
- scientific article; zbMATH DE number 1416070 (Why is no real title available?)
- scientific article; zbMATH DE number 6472882 (Why is no real title available?)
- scientific article; zbMATH DE number 3308993 (Why is no real title available?)
- A bound on the total chromatic number
- A concise proof for total coloring subcubic graphs
- A larger family of planar graphs that satisfy the total coloring conjecture
- A note on Goldberg's conjecture on total chromatic numbers
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- A note on the minimum total coloring of planar graphs
- A note on the total coloring of planar graphs without adjacent 4-cycles
- A note on total colorings of 1-planar graphs
- A result on the total colouring of powers of cycles
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- A total-chromatic number analogue of Plantholt's theorem
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- An introduction to the discharging method via graph coloring
- Behzad-Vizing conjecture and Cartesian product graphs
- Chromatic index of graphs with no cycle with a unique chord
- Coloração Total do C²n
- Coloring Hanoi and Sierpiński graphs
- Colorings of plane graphs: a survey
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Complexity separating classes for edge-colouring and total-colouring
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Determining the total colouring number is NP-hard
- Edge and total coloring of interval graphs
- Edge-coloring of multigraphs: Recoloring technique
- Edge-colouring and total-colouring chordless graphs
- Equitable total coloring of C_m C_n
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable total coloring of corona of cubic graphs
- Even-power of cycles with many vertices are type 1 total colorable
- Graph multiplication
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- List edge and list total coloring of 1-planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- List edge and list total colorings of planar graphs without 6-cycles with chord
- List edge and list total colorings of planar graphs without non-induced 7-cycles
- List edge-coloring and total coloring in graphs of low treewidth
- List total coloring of pseudo-outerplanar graphs
- List total colorings of planar graphs without triangles at small distance
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Minimum total coloring of planar graph
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- On the equitable total chromatic number of cubic graphs
- On the total and AVD-total coloring of graphs
- On the total coloring of generalized Petersen graphs
- On total 9-coloring planar graphs of maximum degree seven
- On total and edge coloring some Kneser graphs
- On total chromatic number of direct product graphs
- On total chromatic number of planar graphs without 4-cycles
- On total coloring of some classes of regular graphs
- On total colorings of 1-planar graphs
- On total colorings of some special 1-planar graphs
- Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- Special classes of snarks
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- Sur le coloriage des graphs
- THE EDGE-CHROHATIC NUMBER OF A CIRCULANT
- The Total Chromatic Number of Graphs of High Minimum Degree
- The hunting of a snark with total chromatic number 5
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- The parameterised complexity of list problems on graphs of bounded treewidth
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total chromatic number of complete multipartite graphs with low deficiency
- The total chromatic number of graphs having large maximum degree
- The total chromatic number of regular graphs of even order and high degree
- The total chromatic number of regular graphs of high degree
- The total chromatic number of some bipartite graphs
- The total chromatic number of split-indifference graphs
- The total-chromatic number of some families of snarks
- Total and fractional total colourings of circulant graphs
- Total chromatic number of \{square,unichord\}-free graphs
- Total chromatic number of generalized Mycielski graphs
- Total chromatic number of one kind of join graphs
- Total chromatic number of regular graphs of odd order and high degree
- Total chromatic number of unichord-free graphs
- Total chromatic numbers
- Total coloring and total matching: polyhedra and facets
- Total coloring conjecture for certain classes of graphs
- Total coloring conjecture for vertex, edge and neighborhood corona products of graphs
- Total coloring for generalized Sierpiński graphs
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- Total coloring of claw-free planar graphs
- Total coloring of embedded graphs of maximum degree at least ten
- Total coloring of embedded graphs with maximum degree at least seven
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Total coloring of outer-1-planar graphs with near-independent crossings
- Total coloring of planar graphs of maximum degree eight
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs with maximum degree 7
- Total coloring of planar graphs without 6-cycles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Total coloring of planar graphs without adjacent short cycles
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs without chordal short cycles
- Total coloring of planar graphs without short cycles
- Total coloring of planar graphs without some chordal 6-cycles
- Total coloring of quasi-line graphs and inflated graphs
- Total coloring of recursive maximal planar graphs
- Total coloring of rooted path graphs
- Total coloring of the prismatic graphs
- Total colorings of F₅-free planar graphs with maximum degree 8
- Total colorings of certain classes of lexicographic product graphs
- Total colorings of circulant graphs
- Total colorings of degenerate graphs
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Total colorings of equibipartite graphs
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Total colorings of planar graphs with small maximum degree
- Total colorings of planar graphs with sparse triangles
- Total colorings of planar graphs without adjacent triangles
- Total colorings of planar graphs without chordal 6-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Total colorings of planar graphs without small cycles
- Total colorings of product graphs
- Total colouring of new classes of subcubic graphs
- Total colouring of some Cartesian and direct product graphs
- Total colourings of Cartesian products
- Total colourings of graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Total-chromatic number and chromatic index of dually chordal graphs
- Total-coloring of sparse graphs with maximum degree 6
- Total-colorings of complete multipartite graphs using amalgamations
- Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs.
- Vertex distinguishing equitable total chromatic number of join graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
Cited in
(9)- Complete characterization of graphs with local total antimagic chromatic number 3
- Total coloring of circulant graphs C_n(1,4)
- A sufficient condition for complete multipartite graphs to be of type 1
- On the chromatic number of powers of subdivisions of graphs
- On total chromatic number of complete multipartite graphs
- Total coloring graphs with large maximum degree
- Total coloring in some split-comparability graphs
- On efficient total colorings of regular graphs
- Total colorings of k-regular graphs of girths 2k and k
This page was built for publication: Total colorings-a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152623)
