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

DOI10.1016/J.DISC.2022.112865zbMATH Open1486.05064OpenAlexW4214734454MaRDI QIDQ2124649FDOQ2124649

Weifan Wang, Yiqiao Wang, Yanping Yang, Danjun Huang

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Point-Arboricity of Planar Graphs
• The point-arboricity of a graph
• 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
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles
• Title not available (Why is that?)
• A Note on the Vertex Arboricity of a Graph
• A note on the list vertex arboricity of toroidal graphs
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• Choosability and edge choosability of planar graphs without five cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without cycles of specific lengths
• On the vertex arboricity of planar graphs of diameter two

Cited In (1)

• List 2-arboricity of planar graphs with no triangles at distance less than two

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)