The total coloring of a multigraph with maximal degree 4
From MaRDI portal
Publication:1259607
DOI10.1016/0012-365X(77)90146-7zbMath0411.05038MaRDI QIDQ1259607
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (46)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ Total chromatic number of {square,unichord}-free graphs ⋮ Total chromatic number of honeycomb network ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Total coloring of certain classes of product graphs ⋮ Total coloring of claw-free planar graphs ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ List edge and list total colourings of multigraphs ⋮ On total colorings of some special 1-planar graphs ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ \((\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 ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ On the AVDTC of Sierpiński-type graphs ⋮ Total coloring conjecture on certain classes of product graphs ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Total chromatic number of unichord-free graphs ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Total colorings of planar graphs without small cycles ⋮ Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) ⋮ The total chromatic number of graphs having large maximum degree ⋮ 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 ⋮ On topological relaxations of chromatic conjectures ⋮ An upper bound for the total chromatic number ⋮ Edge and total coloring of interval graphs ⋮ Total colorings of planar graphs without adjacent triangles ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ Unnamed Item ⋮ 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 ⋮ On the total-neighbor-distinguishing index by sums ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Total coloring of quasi-line graphs and inflated graphs ⋮ On total colorings of 1-planar graphs
Cites Work
This page was built for publication: The total coloring of a multigraph with maximal degree 4
