Total colorings-a survey

DOI10.1080/09728600.2023.2187960arXiv1812.05833OpenAlexW4323665382MaRDI QIDQ6152623

Kanagasabapathi Somasundaram, Narayanan Narayanan, J. Geetha

Publication date: 12 March 2024

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05833

zbMATH Keywords

survey planar graph total coloring non-planar graphs product graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

Total chromatic number of one kind of join graphs
The total chromatic number of regular graphs of even order and high degree
Determining equitable total chromatic number for infinite classes of complete $r$-partite graphs
Total coloring and total matching: polyhedra and facets
TOTAL COLORINGS OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7 AND WITHOUT ADJACENT 5-CYCLES
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
LIST EDGE AND LIST TOTAL COLORINGS OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH CHORD
Total chromatic number of {square,unichord}-free graphs
Edge-coloring of multigraphs: Recoloring technique
Total Colourings of Direct Product Graphs
Behzad-Vizing conjecture and Cartesian product graphs
The total chromatic number of some bipartite graphs
Total-Coloring of Plane Graphs with Maximum Degree Nine
THE EDGE-CHROHATIC NUMBER OF A CIRCULANT
The Total Chromatic Number of Graphs of High Minimum Degree
Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
On total 9-coloring planar graphs of maximum degree seven
Total colourings of Cartesian products
Total coloring conjecture for vertex, edge and neighborhood corona products of graphs
On the total and AVD-total coloring of graphs
Total coloring of the prismatic graphs
Total colorings of circulant graphs
Total coloring of quasi-line graphs and inflated graphs
Total Colouring of New Classes of Subcubic graphs
Coloração Total do C²n
Sur le coloriage des graphs
Total colorings of certain classes of lexicographic product graphs
Edge and total coloring of interval graphs
A note on Goldberg's conjecture on total chromatic numbers
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the total coloring of generalized Petersen graphs
Total-colorings of complete multipartite graphs using amalgamations
Total coloring of planar graphs without chordal 7-cycles
Total coloring of planar graphs without short cycles
Total-chromatic number and chromatic index of dually chordal graphs
On the equitable total chromatic number of cubic graphs
A note on the minimum total coloring of planar graphs
List edge and list total coloring of planar graphs with maximum degree 8
The parameterised complexity of list problems on graphs of bounded treewidth
Total colorings of planar graphs with small maximum degree
Edge-colouring and total-colouring chordless graphs
Total coloring of planar graphs with 7-cycles containing at most two chords
Total coloring of embedded graphs with maximum degree at least seven
List total coloring of pseudo-outerplanar graphs
Total coloring of planar graphs with maximum degree 8
Total chromatic number of generalized Mycielski graphs
Total colorings of $F_5$-free planar graphs with maximum degree 8
$(\Delta + 1)$-total-colorability of plane graphs with maximum degree $\Delta$ at least 6 and without adjacent short cycles
Coloring Hanoi and Sierpiński graphs
A note on the total coloring of planar graphs without adjacent 4-cycles
The total chromatic number of split-indifference graphs
Total colorings of planar graphs without intersecting 5-cycles
Minimum total coloring of planar graph
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
Total coloring of planar graphs without chordal short cycles
An introduction to the discharging method via graph coloring
Total coloring of planar graphs without adjacent short cycles
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
The total-chromatic number of some families of snarks
Total coloring of planar graphs without 6-cycles
Total coloring of embedded graphs of maximum degree at least ten
Local condition for planar graphs of maximum degree 6 to be total 8-colorable
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Total chromatic number of unichord-free graphs
The total chromatic number of graphs having large maximum degree
List edge and list total coloring of 1-planar graphs
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
A larger family of planar graphs that satisfy the total coloring conjecture
A total-chromatic number analogue of Plantholt's theorem
Graph multiplication
A result on the total colouring of powers of cycles
The total chromatic number of complete multipartite graphs with low deficiency
Determining the total colouring number is NP-hard
Total colorings of planar graphs without small cycles
Adjacent vertex distinguishing total colorings of outerplanar graphs
On total chromatic number of direct product graphs
Total coloring of planar graphs of maximum degree eight
Total and fractional total colourings of circulant graphs
Total colorings of planar graphs without adjacent triangles
Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Equitable total coloring of $C_m\square C_n$
The total chromatic number of regular graphs of high degree
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Total chromatic numbers
Total colorings of equibipartite graphs
A bound on the total chromatic number
The total chromatic number of any multigraph with maximum degree five is at most seven
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Total coloring of outer-1-planar graphs with near-independent crossings
Total coloring of rooted path graphs
Total colorings of product graphs
Special classes of snarks
Total colourings of graphs
Total chromatic number of regular graphs of odd order and high degree
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Colorings of plane graphs: a survey
Sufficient conditions for a planar graph to be list edge $\Delta $-colorable and list totally $(\Delta +1)$-colorable
List total colorings of planar graphs without triangles at small distance
$(\Delta +1)$-total-colorability of plane graphs of maximum degree $\Delta\geq 6$ with neither chordal $5$-cycle nor chordal $6$-cycle
Total coloring of planar graphs with maximum degree $7$
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Equitable total coloring of corona of cubic graphs
Total coloring of recursive maximal planar graphs
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
Even-power of cycles with many vertices are type 1 total colorable
Total coloring of claw-free planar graphs
On total coloring of some classes of regular graphs
On total and edge coloring some Kneser graphs
The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
Total-coloring of sparse graphs with maximum degree 6
Chromatic index of graphs with no cycle with a unique chord
Total coloring conjecture for certain classes of graphs
Total coloring of planar graphs without some chordal 6-cycles
On total colorings of 1-planar graphs
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
On total chromatic number of planar graphs without 4-cycles
Complexity separating classes for edge-colouring and total-colouring
On total colorings of some special 1-planar graphs
Total coloring of planar graphs without adjacent chordal 6-cycles
Equitable total coloring of complete $r$-partite $p$-balanced graphs
Total colorings of planar graphs with sparse triangles
A note on list edge and list total coloring of planar graphs without adjacent short cycles
A note on total colorings of 1-planar graphs
A concise proof for total coloring subcubic graphs
The hunting of a snark with total chromatic number 5
Total colorings of planar graphs without chordal 6-cycles
Total colorings of degenerate graphs
Vertex distinguishing equitable total chromatic number of join graphs