Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs

DOI10.1007/978-3-662-53174-7_24zbMath1417.05167OpenAlexW219278678MaRDI QIDQ2827821

Felix Joos

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53174-7_24

zbMATH Keywords

coveringcyclespacking

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (2)

\(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Packing Cycles Faster Than Erdos--Posa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding odd cycle transversals.
• Disjoint cycles intersecting a set of vertices
• Highly parity linked graphs
• Graph minors. V. Excluding a planar graph
• Mangoes and blueberries
• Cycles through specified vertices of a graph
• An improved linear edge bound for graph linkages
• Half-integral packing of odd cycles through prescribed vertices
• Packing cycles through prescribed vertices
• The Erdős-Pósa property for long circuits
• Non-zero disjoint cycles in highly connected group labelled graphs
• On the odd-minor variant of Hadwiger's conjecture
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Odd cycle packing
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Long cycles through prescribed vertices have the Erdős‐Pósa property
• The Erdős-Pósa property for odd cycles in highly connected graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs