Two sufficient conditions for a planar graph to be list vertex-2-arborable

DOI10.1016/j.disc.2022.112865zbMath1486.05064OpenAlexW4214734454MaRDI QIDQ2124649

Yanping Yang, Danjun Huang, Wei Fan Wang, Yi Qiao Wang

Publication date: 11 April 2022

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

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

zbMATH Keywords

cycleplanar graphlist vertex-arboricitylist-forested-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

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
• Planar graphs without cycles of specific lengths
• Choosability and edge choosability of planar graphs without five cycles
• A note on the list vertex arboricity of toroidal graphs
• 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
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• A Note on the Vertex Arboricity of a Graph
• The Point-Arboricity of Planar Graphs

This page was built for publication: Two sufficient conditions for a planar graph to be list vertex-2-arborable