On Total Chromatic Number of a Graph

DOI10.1112/jlms/s2-3.3.405zbMath0223.05103MaRDI QIDQ5628145

N. Vijayaditya

Publication date: 1971

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-3.3.405

Mathematics Subject Classification ID

05C05: Trees

Related Items

Unnamed Item, COLORING ALGORITHMS ON SUBCUBIC GRAPHS, Graph theory, The total chromatic number of graphs having large maximum degree, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, On topological relaxations of chromatic conjectures, Fractional total colouring, Total colorings of planar graphs without small cycles, 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, \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree, The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\), The total chromatic number of some bipartite graphs