Non-separating paths in 4-connected graphs

DOI10.1007/S00026-005-0240-4zbMath1059.05060OpenAlexW2007703264MaRDI QIDQ1773879

Orlando Lee, Xingxing Yu, Ken-ichi Kawarabayashi

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 graphnon-separating pathLovász conjecture

Mathematics Subject Classification ID

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

Related Items (12)

Nonseparating Cycles Avoiding Specific Vertices ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ Removable paths and cycles with parity constraints ⋮ Non-separating even cycles in highly connected graphs ⋮ Spanning trees with nonseparating paths ⋮ A weaker version of Lovász' path removal conjecture ⋮ What is on his mind? ⋮ Removable cycles in non-bipartite graphs ⋮ The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) ⋮ Four Edge-Independent Spanning Trees

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