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

DOI10.1142/S1793830920500809MaRDI QIDQ5859490zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cyclesEuler characteristicintersectingvertex arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cites work

• Choosability and edge choosability of planar graphs without five cycles
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the vertex-arboricity of planar graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• Planar graphs without cycles of specific lengths
• The point-arboricity of a graph
• The Point-Arboricity of Planar Graphs
• Vertex arboricity of planar graphs without chordal 6-cycles
• Vertex arboricity of planar graphs without intersecting 5-cycles
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(3)

• scientific article; zbMATH DE number 1390457 (Why is no real title available?)
• The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
• scientific article; zbMATH DE number 7108969 (Why is no real title available?)

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)