A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph

DOI10.1006/jctb.2000.2024zbMath1030.05068MaRDI QIDQ1850535

Matthias Kriesell

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2024

zbMATH Keywords

distances; reduction; connectivity; contractible edge; degree sum condition; avergage degree

Mathematics Subject Classification ID

05C12: Distance in graphs

05C40: Connectivity

Related Items

Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph, Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph, 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 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, Vertices of degree 6 in a contraction critically 6-connected graph, Trivially noncontractible edges in a contraction critically 5-connected graph, On local structure of 9- and 10-connected graphs, The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs, The number of vertices of degree 5 in a contraction-critically 5-connected graph, Removable edges in a 5-connected graph and a construction method of 5-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, A local structure theorem on 5-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• Contractible non-edges in \(3\)-connected graphs
• Contractible non-edges in triangle-free graphs
• On induced subgraphs of a block