Non-separating subgraphs after deleting many disjoint paths

DOI10.1016/J.JCTB.2010.10.002zbMATH Open1218.05079OpenAlexW2113287106MaRDI QIDQ618034FDOQ618034

Authors: 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

Recommendations

• Non-separating subgraphs
• A note on Lovász removable path conjecture
• Graph connectivity after path removal
• Non-separating paths in 4-connected graphs
• A weaker version of Lovász' path removal conjecture

zbMATH Keywords

non-separating subgraphsLovász conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• 7-connected graphs are 4-ordered
• Non-separating paths in 4-connected graphs
• Graph connectivity after path removal
• Spanning trees with nonseparating paths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618034)