Non-separating subgraphs after deleting many disjoint paths

DOI10.1016/j.jctb.2010.10.002zbMath1218.05079OpenAlexW2113287106MaRDI QIDQ618034

Ken-ichi Kawarabayashi, Kenta Ozeki

Publication date: 14 January 2011

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.2010.10.002

zbMATH Keywords

Lovász conjecturenon-separating subgraphs

Mathematics Subject Classification ID

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

Related Items (2)

Spanning trees with nonseparating paths ⋮ 7-connected graphs are 4-ordered

Cites Work

• A weaker version of Lovász' path removal conjecture
• Non-separating paths in 4-connected graphs
• Graph connectivity after path removal
• Normal hypergraphs and the perfect graph conjecture. (Reprint)
• Induced paths in 5-connected graphs
• Bridges in Highly Connected Graphs
• Nonseparating cycles inK-Connected graphs
• How to Draw a Graph

This page was built for publication: Non-separating subgraphs after deleting many disjoint paths