Partitioning kite‐free planar graphs into two forests

DOI10.1002/JGT.23062MaRDI QIDQ6201024zbMATH OpenOpenAlexFDO

Authors

Publication date 25 March 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.23062

zbMATH Keywords

induced forestkiteplanar graphtrianglevertex partitionvertex-arboricity

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3183246
• scientific article; zbMATH DE number 3285059
• Generalized Cells in Generalized Manifolds
• On a combinatorical problem of K. Zarankiewicz
• scientific article; zbMATH DE number 3195031
• Die Suzukigruppen und ihre Geometrien. Vorlesung Sommersemester 1965 in Mainz
• Time-lag control systems
• A numerical method of calculating the three-dimensional flow of a supersonic gas current around solids

Cites work

• A Note on the Vertex Arboricity of a Graph
• Acyclic colorings of planar graphs
• B-sets and planar maps
• 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
• The point-arboricity of a graph
• The Point-Arboricity of Planar Graphs
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(2)

• Partitioning a planar graph without chordal 5-cycles into two forests.
• Partitioning planar graphs into bounded degree forests

This page was built for publication: Partitioning kite‐free planar graphs into two forests

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