Generalizaions of critical connectivity of graphs
From MaRDI portal
Publication:1115453
DOI10.1016/0012-365X(88)90216-6zbMath0664.05028MaRDI QIDQ1115453
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
connectivitycontraction-critical\({\mathfrak S}\)-atom\({\mathfrak S}\)-end\({\mathfrak S}\)-fragment
Related Items (50)
On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ A constructive characterization of 3-connected triangle-free graphs ⋮ 5-Shredders of Contraction-Critical 5-Connected Graphs ⋮ The symmetric (2k, k)-graphs ⋮ On \(k\)-critical connected line graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Contractible edges in longest cycles ⋮ Splitting and contractible edges in 4-connected graphs ⋮ Non-separating subgraphs in highly connected graphs ⋮ Removable edges in a spanning tree of a \(k\)-connected graph ⋮ 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 ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Contractible edges in non-separating cycles ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ Contractible edges in 2-connected locally finite graphs ⋮ Contractible edges in some k-connected graphs ⋮ Contractible edges in minimally \(k\)-connected graphs ⋮ Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge ⋮ The contractible subgraph of 5-connected graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ Contractible edges in 7-connected graphs ⋮ Contractibility and the Hadwiger conjecture ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ A local structure theorem on 5-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ The number of vertices of degree 7 in a contraction-critical 7-connected graph ⋮ Some properties of contraction-critical 5-connected graphs ⋮ Contractible non-edges in 3-connected infinite graphs ⋮ On the number of 4-contractible edges in 4-connected graphs ⋮ Distribution of contractible edges in k-connected graphs ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9 ⋮ A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs ⋮ How to contract a vertex transitive 5-connected graph ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Contractible subgraphs in 3-connected graphs ⋮ A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ Contractible edges and triangles in \(k\)-connected graphs ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Contractible edges in triangle-free graphs
- Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs)
- On multiply critically h-connected graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- Endlichkeitssätze für k-kritische Graphen
- On k-critical, n-connected graphs
- Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Nonseparating cycles inK-Connected graphs
- Eine Eigenschaft der Atome endlicher Graphen
This page was built for publication: Generalizaions of critical connectivity of graphs
