Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles

DOI10.1016/j.dam.2021.12.020zbMath1482.05279OpenAlexW4206722047MaRDI QIDQ2074364

Min Chen, Dong Chen, Aina Zhu, Wei Fan Wang

Publication date: 9 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.12.020

zbMATH Keywords

cyclecomplete graphtoroidal graphlist vertex-arboricity

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

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
• A note on the list vertex arboricity of toroidal graphs
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• List vertex-arboricity of planar graphs without intersecting 5-cycles
• 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
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Critical Point-Arboritic Graphs
• Toroidal graphs containing neither nor 6‐cycles are 4‐choosable
• The Point-Arboricity of Planar Graphs
• An Analogue to the Heawood Map-Colouring Problem

This page was built for publication: Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles