Vertex-arboricity of toroidal graphs without K₅^- and 6-cycles

DOI10.1016/J.DAM.2021.12.020MaRDI QIDQ2074364zbMATH OpenOpenAlexFDO

Authors Aina Zhu, D. Chen, Min Chen, Weifan 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

complete graphcyclelist vertex-arboricitytoroidal graph

Mathematics Subject Classification ID

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

Recommendations

• Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• Vertex arboricity of toroidal graphs with a forbidden cycle
• A note on the list vertex arboricity of toroidal graphs

Cites work

• A note on the list vertex arboricity of toroidal graphs
• An Analogue to the Heawood Map-Colouring Problem
• Critical Point-Arboritic Graphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• List vertex-arboricity of planar graphs without intersecting 5-cycles
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• On the vertex-arboricity of planar graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• The point-arboricity of a graph
• The Point-Arboricity of Planar Graphs
• Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
• Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(9)

• A note on the list vertex arboricity of toroidal graphs
• List vertex-arboricity of planar graphs without intersecting 5-cycles
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• List vertex arboricity of graphs without forbidden minors.
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2
• Toroidal graphs without K₅^- and 6-cycles
• Commutative rings with unit graphs of small vertex-arboricity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074364)