Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
From MaRDI portal
Publication:1089006
DOI10.1016/0095-8956(87)90053-0zbMath0618.05034MaRDI QIDQ1089006
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90053-0
Related Items
Unnamed Item, Non-separating even cycles in highly connected graphs, What is on his mind?, Contractible cliques in \(k\)-connected graphs, Non-separating subgraphs in highly connected graphs, Note on non-separating and removable cycles in highly connected graphs, Contractible cycles in graphs with large minimum degree, Contractible cycles in graphs with girth at least 5, Contractible edges and triangles in \(k\)-connected graphs, Nonseparating Cycles Avoiding Specific Vertices
Cites Work