On Total Chromatic Number of a Graph

Cited in

(72)

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
Adjacent strong edge colorings and total colorings of regular graphs
The total chromatic number of regular graphs of high degree
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Just two total graphs are complementary
The total coloring of a multigraph with maximal degree 4
Fractionally colouring total graphs
The total chromatic number of any multigraph with maximum degree five is at most seven
List edge and list total colourings of multigraphs
The total chromatic number of pseudo-outerplanar graphs
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
\((\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
Equitable total coloring of corona of cubic graphs
Total coloring of recursive maximal planar graphs
Total coloring of claw-free planar graphs
Total-coloring of sparse graphs with maximum degree 6
On total colorings of 1-planar graphs
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
(d,1)-total labelling of planar graphs with large girth and high maximum degree
On group choosability of total graphs
\(L(2, 1)\)-labelings of the edge-path-replacement of a graph
On total colorings of some special 1-planar graphs
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
A concise proof for total coloring subcubic graphs
The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
\( L ( p , q )\)-labelings of subdivisions of graphs
On the total coloring of generalized Petersen graphs
Total coloring of planar graphs without chordal 7-cycles
Total chromatic number of \{square,unichord\}-free graphs
On the equitable total chromatic number of cubic graphs
Total coloring of certain classes of product graphs
The total chromatic number of some bipartite graphs
L(d,1)-labelings of the edge-path-replacement of a graph
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
Coloring 3-power of 3-subdivision of subcubic graph
Randomly colouring graphs (a combinatorial view)
\(L(2,1)\)-labelings of subdivisions of graphs
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
TOTAL COLORING OF CERTAIN GRAPHS
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
The total-chromatic number of some families of snarks
COLORING ALGORITHMS ON SUBCUBIC GRAPHS
scientific article; zbMATH DE number 2230302 (Why is no real title available?)
Graph theory
Total coloring of planar graphs without some adjacent cycles
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
On total coloring and equitable total coloring of infinite snark families
Total coloring conjecture on certain classes of product graphs
Total coloring of planar graphs without 6-cycles
Total coloring of embedded graphs of maximum degree at least ten
Total chromatic number of unichord-free graphs
Entire colouring of plane graphs
Total coloring of middle graph of certain snake graph families
Computation of total chromatic number for certain convex polytope graphs
The total chromatic number of graphs having large maximum degree
A sufficient condition for complete multipartite graphs to be of type 1
On efficient total colorings of regular graphs
Total colorings of k-regular graphs of girths 2k and k
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
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
Fractional total colouring
Facial entire colouring of plane graphs
Total colorings of planar graphs without small cycles

This page was built for publication: On Total Chromatic Number of a Graph

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