The total coloring of a multigraph with maximal degree 4

Cites work

Complementary Graphs and Edge Chromatic Numbers
scientific article; zbMATH DE number 3144962 (Why is no real title available?)
scientific article; zbMATH DE number 3221976 (Why is no real title available?)
On the total coloring of certain graphs
On Total Chromatic Number of a Graph
Parallel concepts in graph theory
SOME UNSOLVED PROBLEMS IN GRAPH THEORY
The Colour Numbers of Complete Graphs

Cited in

(50)

Equitable total coloring of C_m C_n
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
The total chromatic number of regular graphs of high degree
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
The total chromatic number of regular graphs whose complement is bipartite
The total chromatic number of any multigraph with maximum degree five is at most seven
List edge and list total colourings of multigraphs
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
\((\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 outer-1-planar graphs: the cold case
Total coloring of recursive maximal planar graphs
Total coloring of claw-free planar graphs
Total-coloring of sparse graphs with maximum degree 6
An upper bound for the total chromatic number
On the total-neighbor-distinguishing index by sums
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
On total colorings of some special 1-planar graphs
On total coloring the direct product of cycles and bipartite direct product of graphs
Total chromatic number of \{square,unichord\}-free graphs
Total coloring of certain classes of product graphs
Total coloring of embedded graphs with maximum degree at least seven
( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
On the total choosability of planar graphs and of sparse graphs
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
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 quasi-line graphs and inflated graphs
Total chromatic number of honeycomb network
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
scientific article; zbMATH DE number 2230302 (Why is no real title available?)
Edge and total coloring of interval graphs
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
On the AVDTC of Sierpiński-type graphs
Total coloring conjecture on certain classes of product graphs
Total coloring of planar graphs without 6-cycles
Total choosability of planar graphs with maximum degree 4
Total coloring of embedded graphs of maximum degree at least ten
Total chromatic number of unichord-free graphs
Total coloring of middle graph of certain snake graph families
Computation of total chromatic number for certain convex polytope graphs
Total coloring of circulant graphs C_n(1,4)
The total chromatic number of graphs having large maximum degree
A sufficient condition for complete multipartite graphs to be of type 1
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
On topological relaxations of chromatic conjectures
A larger family of planar graphs that satisfy the total coloring conjecture
Total colorings of planar graphs without small cycles
Total colorings of planar graphs without adjacent triangles

This page was built for publication: The total coloring of a multigraph with maximal degree 4

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