Highly parity linked graphs
From MaRDI portal
Publication:987554
DOI10.1007/s00493-009-2343-3zbMath1212.05143OpenAlexW1812326786WikidataQ126580904 ScholiaQ126580904MaRDI QIDQ987554
Ken-ichi Kawarabayashi, Bruce A. Reed
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-009-2343-3
Related Items (16)
Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ On Modulo Linked Graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Packing cycles with modularity constraints ⋮ Linked graphs with restricted lengths ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Non-zero disjoint cycles in highly connected group labeled graphs
This page was built for publication: Highly parity linked graphs
