Contractible edges in \(k\)-connected graphs with some forbidden subgraphs

DOI10.1007/s00373-013-1358-0zbMath1306.05133OpenAlexW1990378430MaRDI QIDQ489329

Liang Sun, Yingqiu Yang

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1358-0

zbMATH Keywords

\(k\)-connected graphcontractible edgefragmentminimum fragment

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

$K_5^-$-Subdivision in 4-Connected Graphs ⋮ Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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\)]
• Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
• Vertices of degree 5 in a contraction critically 5-connected graph
• Trivially noncontractible edges in a contraction critically 5-connected graph
• 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 edges in minimally \(k\)-connected graphs
• 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