List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles.
From MaRDI portal
Publication:3134401
zbMATH Open1424.05108MaRDI QIDQ3134401FDOQ3134401
Authors: Ling Xue 
Publication date: 9 February 2018
Recommendations
- List vertex-arboricity of planar graphs without intersecting 5-cycles
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2
- On list vertex 2-arboricity of toroidal graphs without cycles of specific length
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cited In (5)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- List point arboricity of graphs
- List vertex arboricity of graphs without forbidden minors.
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- List vertex-arboricity of planar graphs without intersecting 5-cycles
This page was built for publication: List vertex arboricity of planar graphs with \(5\)-cycles not adjacent to \(3\)-cycles and \(4\)-cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134401)
