Nonseparating cycles inK-Connected graphs
From MaRDI portal
Publication:3963043
DOI10.1002/jgt.3190050403zbMath0498.05044OpenAlexW1516768651MaRDI 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
Related Items (61)
Contractible edges in triangle-free graphs ⋮ Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph ⋮ On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Contractible cliques in \(k\)-connected graphs ⋮ Nonseparating Cycles Avoiding Specific Vertices ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ Contractible cycles in graphs with large minimum degree ⋮ Generalizaions of critical connectivity of graphs ⋮ A constructive characterization of 3-connected triangle-free graphs ⋮ Contractible small subgraphs in \(k\)-connected graphs ⋮ The symmetric (2k, k)-graphs ⋮ Induced paths in 5-connected graphs ⋮ Non-contractible non-edges in 2-connected graphs ⋮ Max-min weight balanced connected partition ⋮ On local structure of 9- and 10-connected graphs ⋮ A new forbidden subgraph for 5-contractible edges ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ Removable paths and cycles with parity constraints ⋮ Contractible edges in longest cycles ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ A result on quasi \(k\)-connected graphs ⋮ Non-separating subgraphs in highly connected graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Vertices of degree 6 in a contraction critically 6-connected graph ⋮ The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs ⋮ Non-separating even cycles in highly connected graphs ⋮ Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)] ⋮ Contractible triples in highly connected graphs ⋮ Contractible edges in non-separating cycles ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ Contractible edges in some k-connected graphs ⋮ Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge ⋮ A weaker version of Lovász' path removal conjecture ⋮ Contractible edges in minimally \(k\)-connected graphs ⋮ Local structure of 7- and 8-connected graphs ⋮ A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ What is on his mind? ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Contractible edges in 7-connected graphs ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ Extremal infinite graph theory ⋮ The number of vertices of degree 5 in a contraction-critically 5-connected graph ⋮ A new forbidden pair for 6-contractible edges ⋮ A local structure theorem on 5-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ Infinite highly connected planar graphs of large girth ⋮ The number of vertices of degree 7 in a contraction-critical 7-connected graph ⋮ Some properties of contraction-critical 5-connected graphs ⋮ Note on non-separating and removable cycles in highly connected graphs ⋮ Distribution of contractible edges in k-connected graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Contractible cycles in graphs with girth at least 5 ⋮ A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs ⋮ A local condition for \(k\)-contractible edges ⋮ Contractible edges and triangles in \(k\)-connected graphs ⋮ Vertices of degree 6 in a 6-contraction critical graph
Cites Work
This page was built for publication: Nonseparating cycles inK-Connected graphs
