List total arboricity of 2-degenerate graphs

DOI10.1016/j.aml.2012.04.011zbMath1251.05060OpenAlexW1992002504MaRDI QIDQ714512

Timothy J. Hetherington

Publication date: 11 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.04.011

zbMATH Keywords

total colouringouterplanar graphminor-free graphlist colouringpoint arboricity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (1)

Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-arboricity of planar graphs without intersecting triangles
• List point arboricity of dense graphs
• Every circle graph of girth at least 5 is 3-colourable
• A note on list arboricity
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Acyclic edge coloring of 2-degenerate graphs
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Critical Point-Arboritic Graphs
• The Point-Arboricity of Planar Graphs
• Decomposition of Finite Graphs Into Forests
• Acyclic colorings of planar graphs

This page was built for publication: List total arboricity of 2-degenerate graphs