List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles

DOI10.1016/j.disc.2016.04.010zbMath1339.05204OpenAlexW2400865459MaRDI QIDQ294558

Min Chen, Li Huang, Wei Fan Wang

Publication date: 16 June 2016

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

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

zbMATH Keywords

toroidal graphsadjacent cycleslist vertex-arboricitymonochromatic cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

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 ⋮ Variable degeneracy on toroidal graphs ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ A structural property of trees with an application to vertex-arboricity ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The point-arboricity of a graph
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Critical Point-Arboritic Graphs
• The Point-Arboricity of Planar Graphs
• An Analogue to the Heawood Map-Colouring Problem
• Acyclic colorings of planar graphs

This page was built for publication: List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles