Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
From MaRDI portal
Publication:1175546
DOI10.1007/BF01789459zbMath0758.05063MaRDI QIDQ1175546
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (33)
Reduction for 3-connected graphs of minimum degree at least four ⋮ Removable edges in cyclically 4-edge-connected cubic graphs ⋮ Generalizaions of critical connectivity of graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Contractible edges in longest cycles ⋮ A result on quasi \(k\)-connected graphs ⋮ Non-separating subgraphs in highly connected graphs ⋮ 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 \(k\)-connected graphs with some forbidden subgraphs ⋮ Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ 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 ⋮ Contractible edges in 7-connected graphs ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ The number of vertices of degree 5 in a contraction-critically 5-connected graph ⋮ A local structure theorem on 5-connected graphs ⋮ Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \) ⋮ The number of vertices of degree 7 in a contraction-critical 7-connected graph ⋮ Some properties of contraction-critical 5-connected graphs ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs ⋮ 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 ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ A local condition for \(k\)-contractible edges ⋮ A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ Contractible edges and triangles in \(k\)-connected graphs ⋮ Vertices of degree 6 in a 6-contraction critical graph
Cites Work
- Unnamed Item
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Contractible edges in triangle-free graphs
- Contractible edges in 3-connected graphs
- Planarity and duality of finite and infinite graphs
- Nonseparating cycles inK-Connected graphs
- A Note on k-Critically n-Connected Graphs
- Eine Eigenschaft der Atome endlicher Graphen
This page was built for publication: Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
