List vertex-arboricity of planar graphs without intersecting 5-cycles

DOI10.1007/s10255-020-0936-1zbMath1437.05185OpenAlexW3015506657MaRDI QIDQ1987594

Li Huang, Min Chen, Wei Fan Wang

Publication date: 15 April 2020

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-020-0936-1

zbMATH Keywords

planar graphsintersecting cycleslist vertex-arboricitymonochromatic cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs

This page was built for publication: List vertex-arboricity of planar graphs without intersecting 5-cycles