Contractible edges in 7-connected graphs
From MaRDI portal
Publication:2494103
DOI10.1007/s00373-005-0621-4zbMath1092.05038MaRDI QIDQ2494103
Publication date: 16 June 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0621-4
05C40: Connectivity
Related Items
The number of vertices of degree 7 in a contraction-critical 7-connected graph, Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs, On local structure of 9- and 10-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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizaions of critical connectivity of graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- Nonseparating cycles inK-Connected graphs
- Uncontractable 4-connected graphs
- Eine Eigenschaft der Atome endlicher Graphen