Graph connectivity after path removal
From MaRDI portal
Publication:1878600
DOI10.1007/s003-0018-zzbMath1046.05044OpenAlexW2035507719MaRDI QIDQ1878600
Xingxing Yu, Ronald J. Gould, Guantao Chen
Publication date: 7 September 2004
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003-0018-z
Related Items
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?, 7-connected graphs are 4-ordered, Removable cycles in non-bipartite graphs, The Kelmans-Seymour conjecture. IV: A proof
