Non-separating paths in 4-connected graphs

DOI10.1007/S00026-005-0240-4MaRDI QIDQ1773879zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Orlando Lee, Xingxing Yu

Publication date 28 April 2005

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-005-0240-4

zbMATH Keywords

4-connected graphLovász conjecturenon-separating path

Mathematics Subject Classification ID

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

Recommendations

• Non-separating subgraphs
• Non-separating subgraphs after deleting many disjoint paths
• Graph connectivity after path removal
• Induced paths in 5-connected graphs
• Nonseparating Cycles in 4-Connected Graphs

Cited in

(17)

• Graph connectivity after path removal
• Non-separating subgraphs
• Removable cycles in non-bipartite graphs
• Induced paths in 5-connected graphs
• Four edge-independent spanning trees
• Nonseparating cycles avoiding specific vertices
• Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
• Removable paths and cycles with parity constraints
• On a conjecture of Thomassen and Toft
• Spanning trees with nonseparating paths
• Independent paths and \(K_{5}\)-subdivisions
• Non-separating subgraphs after deleting many disjoint paths
• Non-separating even cycles in highly connected graphs
• On the mixed connectivity conjecture of Beineke and Harary
• What is on his mind?
• The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
• A weaker version of Lovász' path removal conjecture

This page was built for publication: Non-separating paths in 4-connected graphs

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