Nonseparating cycles inK-Connected graphs
From MaRDI portal
Publication:3963043
DOI10.1002/jgt.3190050403zbMath0498.05044MaRDI QIDQ3963043
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050403
05C40: Connectivity
Related Items
Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)], Contractible edges in non-separating cycles, Contractible cycles in graphs with large minimum degree, Partitions of graphs with high minimum degree or connectivity., Vertices of degree 6 in a contraction critically 6-connected graph, Contractible cycles in graphs with girth at least 5, Trivially noncontractible edges in a contraction critically 5-connected graph, Contractible edges and triangles in \(k\)-connected graphs, Unnamed Item, Unnamed Item