Trivially noncontractible edges in a contraction critically 5-connected graph

DOI10.1016/j.disc.2004.08.021zbMath1063.05078OpenAlexW1989262419MaRDI QIDQ1779484

Kiyoshi Ando

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.021

zbMATH Keywords

5-connected graphContractible edgeContraction critically \(k\)-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (7)

Small components of the 5-subgraph of a contraction-critically 5-connected graph ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ A local structure theorem on 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

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\)]
• Vertices of degree 5 in a contraction critically 5-connected graph
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs

This page was built for publication: Trivially noncontractible edges in a contraction critically 5-connected graph