Caterpillar arboricity of planar graphs

DOI10.1016/J.DISC.2005.12.055zbMATH Open1121.05038OpenAlexW2094917705MaRDI QIDQ2370451FDOQ2370451

Authors: Daniel Gonçalves 

Publication date: 26 June 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.055

Recommendations

• On star and caterpillar arboricity
• The caterpillar-packing polytope
• On caterpillar factors in graphs
• Covering planar graphs with forests
• Spanning caterpllars with bounded diameter

zbMATH Keywords

arboricityplanar graphscaterpillar

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On acyclic colorings of planar graphs
• Efficient Planarity Testing
• Decomposition of Finite Graphs Into Forests
• Monotone paths in edge-ordered sparse graphs
• Star arboricity of graphs
• Title not available (Why is that?)
• The interval number of a planar graph: Three intervals suffice
• Research problems

Cited In (23)

• Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
• Trees, Paths, Stars, Caterpillars and Spiders
• The Treewidth and Pathwidth of Graph Unions
• The interval number of a planar graph is at most three
• Rollercoasters and caterpillars
• Covering planar graphs with forests, one having a bounded maximum degree
• Graphs with only caterpillars as spanning trees
• Planar Ramsey graphs
• On interval representations of graphs
• The Graph Structure of the Generalized Discrete Arnold's Cat Map
• On caterpillar factors in graphs
• The caterpillar-packing polytope
• The Local Queue Number of Graphs with Bounded Treewidth
• Title not available (Why is that?)
• Covering planar graphs with forests, one having bounded maximum degree
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Trees, paths, stars, caterpillars and spiders
• Edge-intersection graphs of grid paths: the bend-number
• Three ways to cover a graph
• On star and caterpillar arboricity
• Most edge-orderings of \(K_{n}\) have maximal altitude
• Maximal independent sets in a generalisation of caterpillar graph
• A new sum of graphs and caterpillar trees

This page was built for publication: Caterpillar arboricity of planar graphs

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