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

DOI10.1142/S1793830920500809zbMATH Open1458.05084OpenAlexW3036767993MaRDI QIDQ5859490FDOQ5859490

Authors: Wenshun Teng, Huijuan 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

Recommendations

• Vertex arboricity of planar graphs without intersecting 5-cycles
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• Vertex arboricity of planar graphs without chordal 6-cycles
• On the vertex-arboricity of planar graphs without 7-cycles
• On the vertex-arboricity of planar graphs

zbMATH Keywords

Euler characteristiccyclesvertex arboricityintersecting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• 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
• On the vertex-arboricity of planar graphs
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles
• Vertex arboricity of planar graphs without intersecting 5-cycles
• Vertex arboricity of planar graphs without chordal 6-cycles
• Choosability and edge choosability of planar graphs without five cycles
• Planar graphs without cycles of specific lengths

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859490)