The total chromatic number of any multigraph with maximum degree five is at most seven

Cites work

scientific article; zbMATH DE number 4108789 (Why is no real title available?)
scientific article; zbMATH DE number 3659620 (Why is no real title available?)
scientific article; zbMATH DE number 3661375 (Why is no real title available?)
scientific article; zbMATH DE number 3284071 (Why is no real title available?)
scientific article; zbMATH DE number 3349876 (Why is no real title available?)
An Improvement of Hind's Upper Bound on the Total Chromatic Number
An upper bound for the total chromatic number
Critical Point-Arboritic Graphs
Matching theory
On Total Chromatic Number of a Graph
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
The total coloring of a multigraph with maximal degree 4

Cited in

(84)

Total coloring of embedded graphs with maximum degree at least seven
$(2,1)$-total labelling of outerplanar graphs
Total coloring of planar graphs without adjacent short cycles
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
On the total choosability of planar graphs and of sparse graphs
Minimum total coloring of planar graph
Total coloring of planar graphs without chordal 7-cycles
Total colorings of planar graphs without small cycles
Total colorings of planar graphs with sparse triangles
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
Entire colouring of plane graphs
Total coloring of planar graphs with 7-cycles containing at most two chords
Total coloring of planar graphs with maximum degree 8
( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
Total colorings of F₅-free planar graphs with maximum degree 8
A note on the total coloring of planar graphs without adjacent 4-cycles
Total colorings of planar graphs without intersecting 5-cycles
Total coloring of planar graphs without chordal short cycles
Total colorings-a survey
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Total coloring of planar graphs without short cycles
Total coloring of planar graphs without 6-cycles
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Total chromatic number of unichord-free graphs
Facial entire colouring of plane graphs
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
The total coloring of $K_5$-minor-free graphs
A larger family of planar graphs that satisfy the total coloring conjecture
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
($ \Delta + 1$)-total choosability of planar graphs with no cycles of length from 4 to $k$ and without close triangles
List edge and list total colourings of multigraphs
A note on total and list edge-colouring of graphs of tree-width 3
Total choosability of planar graphs with maximum degree 4
On total colorings of 1-planar graphs
Randomly colouring graphs (a combinatorial view)
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
The total chromatic number of graphs of even order and high degree
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Total chromatic number of \{square,unichord\}-free graphs
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
The total chromatic number of regular graphs of even order and high degree
Total coloring of planar graphs with maximum degree 7
Computation of total chromatic number for certain convex polytope graphs
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
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Total coloring of outer-1-planar graphs: the cold case
Total colorings of planar graphs without adjacent triangles
Minimum total coloring of planar graphs with maximum degree 8
Total coloring of quasi-line graphs and inflated graphs
On total chromatic number of planar graphs without 4-cycles
Total coloring conjecture on certain classes of product graphs
Total coloring of planar graphs without some chordal 6-cycles
Total coloring of embedded graphs of maximum degree at least ten
On total coloring of some classes of regular graphs
Total colorings of planar graphs without chordal 6-cycles
Edge and total coloring of interval graphs
Total and fractional total colourings of circulant graphs
$(\Delta +1)$-total-colorability of plane graphs of maximum degree $\Delta\geq 6$ with neither chordal $5$-cycle nor chordal $6$-cycle
The total chromatic number of regular graphs of high degree
Neighbor sum distinguishing total colorings of $K_4$-minor free graphs
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
Total-coloring of sparse graphs with maximum degree 6
On total colorings of some special 1-planar graphs
$[r,s,t]$-colorings of graphs
Total coloring of planar graphs without adjacent chordal 6-cycles
$[r,s,t]$-chromatic numbers and hereditary properties of graphs
scientific article; zbMATH DE number 6837048 (Why is no real title available?)
List edge-coloring and total coloring in graphs of low treewidth
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
A totally $(\Delta + 1)$-colorable 1-planar graph with girth at least five
Total coloring of planar graphs without some adjacent cycles
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
Coloring 3-power of 3-subdivision of subcubic graph
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
The total chromatic number of split-indifference graphs
Total coloring of recursive maximal planar graphs
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
Total coloring of some graph operations

This page was built for publication: The total chromatic number of any multigraph with maximum degree five is at most seven

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356668)