Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic

DOI10.1142/S1793830920500809zbMath1458.05084OpenAlexW3036767993MaRDI QIDQ5859490

Wenshun Teng, Hui-Juan Wang

Publication date: 16 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500809

zbMATH Keywords

Euler characteristiccyclesvertex arboricityintersecting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• Planar graphs without cycles of specific lengths
• Choosability and edge choosability of planar graphs without five cycles
• Vertex arboricity of planar graphs without intersecting 5-cycles
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Vertex arboricity of planar graphs without chordal 6-cycles
• The Point-Arboricity of Planar Graphs

This page was built for publication: Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic