A note on the list vertex arboricity of toroidal graphs

DOI10.1016/j.disc.2018.08.021zbMath1397.05069OpenAlexW2890371963MaRDI QIDQ1800404

Min Chen, Yi Qiao Wang, Wei Fan Wang

Publication date: 23 October 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.021

zbMATH Keywords

toroidal graphlist vertex arboricitycomplete graph \(K_7\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• On the vertex arboricity of planar graphs of diameter two
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Critical Point-Arboritic Graphs
• A Note on the Vertex Arboricity of a Graph
• An Analogue to the Heawood Map-Colouring Problem

This page was built for publication: A note on the list vertex arboricity of toroidal graphs