Edge-disjoint odd cycles in planar graphs.

DOI10.1016/S0095-8956(03)00078-9zbMath1033.05064WikidataQ57601583 ScholiaQ57601583MaRDI QIDQ1425111

Daniel Král', Heinz-Juergen Voss

Publication date: 15 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Erdős-Pósa property; Bipartite graphs; Planar graphs; Odd cycles

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

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

Related Items

Approximate min-max relations on plane graphs, Packing and covering tetrahedra, The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces, Approximate min-max relations for odd cycles in planar graphs, Planar graph bipartization in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mangoes and blueberries
• The four-colour theorem
• On a conjecture of Tuza about packing and covering of triangles
• Optimal packings of edge-disjoint odd cycles
• A conjecture on triangles of graphs
• On Odd Cuts and Plane Multicommodity Flows
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• On Independent Circuits Contained in a Graph
• Node-and edge-deletion NP-complete problems
• A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
• The Erdős-Pósa property for odd cycles in highly connected graphs