The total chromatic number of any multigraph with maximum degree five is at most seven
From MaRDI portal
Publication:1356668
DOI10.1016/0012-365X(95)00286-6zbMath0871.05023MaRDI QIDQ1356668
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (81)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ Total chromatic number of {square,unichord}-free graphs ⋮ The total coloring of \(K_5\)-minor-free graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ A note on the minimum total coloring of planar graphs ⋮ Total coloring of certain classes of product graphs ⋮ Total coloring of claw-free planar graphs ⋮ Coloring 3-power of 3-subdivision of subcubic graph ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ List edge and list total colourings of multigraphs ⋮ \([r,s,t\)-colorings of graphs] ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ On total coloring of some classes of regular graphs ⋮ On total colorings of some special 1-planar graphs ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ 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 ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Facial entire colouring of plane graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ Total colorings-a survey ⋮ Total coloring conjecture on certain classes of product graphs ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ \((\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\) ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ The total chromatic number of graphs of even order and high degree ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of planar graphs with sparse triangles ⋮ The total chromatic number of split-indifference graphs ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Total chromatic number of unichord-free graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total colorings of planar graphs without small cycles ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ Edge and total coloring of interval graphs ⋮ A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable ⋮ Total and fractional total colourings of circulant graphs ⋮ Total colorings of planar graphs without adjacent triangles ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ Total coloring of recursive maximal planar graphs ⋮ The total chromatic number of regular graphs of high degree ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ The total chromatic number of regular graphs of even order and high degree ⋮ Total coloring of planar graphs without some chordal 6-cycles ⋮ Total coloring of quasi-line graphs and inflated graphs ⋮ On total colorings of 1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- The total coloring of a multigraph with maximal degree 4
- An upper bound for the total chromatic number
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Critical Point-Arboritic Graphs
- An Improvement of Hind's Upper Bound on the Total Chromatic Number
- On Total Chromatic Number of a Graph
This page was built for publication: The total chromatic number of any multigraph with maximum degree five is at most seven
