Contractible triples in 3-connected graphs
From MaRDI portal
Publication:1322026
DOI10.1006/jctb.1994.1022zbMath0794.05061OpenAlexW2026728521MaRDI QIDQ1322026
Katsuhiro Ota, William D. McCuaig
Publication date: 5 May 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1022
Related Items (15)
Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ Contractible small subgraphs in \(k\)-connected graphs ⋮ Induced paths in 5-connected graphs ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ On \(k\)-con-critically \(n\)-connected graphs ⋮ On contractible 5-vertex subgraphs of a 3-connected graph ⋮ Large contractible subgraphs of a 3-connected graph ⋮ Contractible triples in highly connected graphs ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ On small contractible subgraphs in 3-connected graphs of small average degree ⋮ On the number of contractible triples in 3-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Contractible subgraphs in 3-connected graphs ⋮ Almost all 3-connected graphs contain a contractible set of \(k\) vertices
This page was built for publication: Contractible triples in 3-connected graphs
