Induced Packing of Odd Cycles in a Planar Graph
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- Induced packing of odd cycles in planar graphs
- Half-integral packing of odd cycles through prescribed vertices
- Packing cycles in graphs
- Planar packing of cycles and unicyclic graphs
- Edge-packing planar graphs by cyclic graphs
- Optimal packings of edge-disjoint odd cycles
- Packing cycles in complete graphs
- Cycle packings in graphs and digraphs
- Packing odd circuits in Eulerian graphs
- Packing cycles in graphs. II
Cited in
(10)- The \(k\)-in-a-path problem for claw-free graphs
- Graph minors and parameterized algorithm design
- Tight bounds for linkages in planar graphs
- Irrelevant vertices for the planar disjoint paths problem
- Confronting intractability via parameters
- Packing and covering odd cycles in cubic plane graphs with small faces
- Combing a Linkage in an Annulus
- Induced odd cycle packing number, independent sets, and chromatic number
- Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions
- Induced packing of odd cycles in planar graphs
This page was built for publication: Induced Packing of Odd Cycles in a Planar Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652239)
