A note on the list vertex-arboricity of IC-planar graphs
From MaRDI portal
Publication:6542022
DOI10.1016/J.DISC.2024.113998MaRDI QIDQ6542022FDOQ6542022
Yang Wang, Weifan Wang, Lina Zheng, Yiqiao Wang
Publication date: 21 May 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) 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)
Cites Work
- A new proof of the 6 color theorem
- The point-arboricity of a graph
- On the vertex-arboricity of planar graphs without 7-cycles
- Coloring plane graphs with independent crossings
- On the vertex-arboricity of planar graphs
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Vertex-arboricity of planar graphs without intersecting triangles
- A Note on the Vertex Arboricity of a Graph
- 5-choosability of graphs with crossings far apart
- Graphs with Two Crossings Are 5-Choosable
- On the vertex arboricity of planar graphs of diameter two
- IC-Planar Graphs Are 6-Choosable
This page was built for publication: A note on the list vertex-arboricity of IC-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542022)
