Total colorings of degenerate graphs

DOI10.1007/s00493-007-0050-5zbMath1164.05024OpenAlexW1869361267MaRDI QIDQ2460621

Xiao Zhou, Takao Nishizeki, Shuji Isobe

Publication date: 12 November 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-007-0050-5

zbMATH Keywords

degenerate graphstotal colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Even-power of cycles with many vertices are type 1 total colorable ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Some bounds on the generalised total chromatic number of degenerate graphs ⋮ Linear arboricity of degenerate graphs ⋮ Total colorings-a survey ⋮ Chromatic index, treewidth and maximum degree ⋮ Chromatic index, treewidth and maximum degree ⋮ Maximum cardinality neighbourly sets in quadrilateral free graphs ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs

This page was built for publication: Total colorings of degenerate graphs