Partitioning kite‐free planar graphs into two forests

DOI10.1002/jgt.23062OpenAlexW4389607280MaRDI QIDQ6201024

No author found.

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

triangleplanar graphvertex-arboricityvertex partitioninduced forestkite

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)

Cites Work

• Unnamed Item
• 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
• B-sets and planar maps
• A Note on the Vertex Arboricity of a Graph
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs

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