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

DOI10.1016/J.DISC.2022.112865MaRDI QIDQ2124649zbMATH OpenOpenAlexFDO

Authors Yanping Yang, Danjun Huang, Yiqiao Wang, Weifan 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• List vertex-arboricity of planar graphs without intersecting 5-cycles
• List vertex arboricity of planar graphs of diameter two
• List vertex arboricity of planar graphs with \(5\)-cycles not adjacent to \(3\)-cycles and \(4\)-cycles.
• On the vertex-arboricity of planar graphs without 7-cycles
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• A Note on the Vertex Arboricity of a Graph
• A note on the list vertex arboricity of toroidal graphs
• Choosability and edge choosability of planar graphs without five 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 of diameter two
• On the vertex-arboricity of planar graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Planar graphs without cycles of specific lengths
• The Point-Arboricity of Planar Graphs
• The point-arboricity of a graph
• 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

(8)

• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• List vertex arboricity of graphs without forbidden minors.
• List vertex arboricity of planar graphs with \(5\)-cycles not adjacent to \(3\)-cycles and \(4\)-cycles.
• A note on the list vertex arboricity of toroidal graphs
• List vertex-arboricity of planar graphs without intersecting 5-cycles
• List 2-arboricity of planar graphs with no triangles at distance less than two
• List vertex arboricity of planar graphs of diameter two
• A note on the list vertex-arboricity of IC-planar graphs

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

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