Non-separating subgraphs after deleting many disjoint paths

DOI10.1016/J.JCTB.2010.10.002MaRDI QIDQ618034zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

non-separating subgraphsLovász conjecture

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• Non-separating subgraphs
• 7-connected graphs are 4-ordered
• Non-separating paths in 4-connected graphs
• Graph connectivity after path removal
• On the mixed connectivity conjecture of Beineke and Harary
• 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)