Removable paths and cycles with parity constraints

DOI10.1016/j.jctb.2014.01.005zbMath1297.05126OpenAlexW2060031821MaRDI QIDQ402593

Orlando Lee, Ken-ichi Kawarabayashi, Bruce A. Reed

Publication date: 28 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.01.005

zbMATH Keywords

connectivity in graphsnon-separating paths and cyclesparity in path and cyclesremovable paths and cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• A weaker version of Lovász' path removal conjecture
• Non-separating paths in 4-connected graphs
• Graph connectivity after path removal
• Removable cycles in non-bipartite graphs
• Induced paths in 5-connected graphs
• Nonseparating cycles inK-Connected graphs
• How to Draw a Graph
• The Erdős-Pósa property for odd cycles in graphs of large connectivity
• Unnamed Item

This page was built for publication: Removable paths and cycles with parity constraints