Induced Packing of Odd Cycles in a Planar Graph

DOI10.1007/978-3-642-10631-6_53zbMath1272.05157OpenAlexW2155066729MaRDI QIDQ3652239

Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos, Petr A. Golovach

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_53

zbMATH Keywords

packingodd cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Graph Minors and Parameterized Algorithm Design ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ Combing a Linkage in an Annulus ⋮ Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions ⋮ The \(k\)-in-a-path problem for claw-free graphs ⋮ Confronting intractability via parameters ⋮ Tight Bounds for Linkages in Planar Graphs ⋮ Induced packing of odd cycles in planar graphs

This page was built for publication: Induced Packing of Odd Cycles in a Planar Graph