A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs

DOI10.1016/j.disc.2008.07.020zbMath1203.05084OpenAlexW1976708822MaRDI QIDQ1043641

Jianji Su, Ting-Ting Li

Publication date: 9 December 2009

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

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

zbMATH Keywords

fragment5-connectedcontraction criticaltrivially noncontractible edge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items (2)

The removable edges and the contractible subgraphs of 5-connected graphs ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9

Cites Work

• 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\)]
• 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
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs
• Triangle Density and Contractibility

This page was built for publication: A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs