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

DOI10.1016/J.DISC.2008.07.020zbMATH Open1203.05084OpenAlexW1976708822MaRDI QIDQ1043641FDOQ1043641

Authors: Jianji Su, Tingting 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

Recommendations

• Trivially noncontractible edges in a contraction critically 5-connected graph
• The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• Some properties of contraction-critical 5-connected graphs
• Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• scientific article; zbMATH DE number 139920
• Some structural properties of minimally contraction-critically 5-connected graphs
• Contractible edges of \(k\)-connected graphs for \(k=4,5\).
• A new forbidden subgraph for 5-contractible edges

zbMATH Keywords

fragment5-connectedcontraction criticaltrivially noncontractible edge

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Uncontractable 4-connected graphs
• Generalizaions of critical connectivity of graphs
• Title not available (Why is that?)
• Nonseparating cycles inK-Connected 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
• Triangle Density and Contractibility

Cited In (4)

• Trivially noncontractible edges in a contraction critically 5-connected graph
• A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
• The removable edges and the contractible subgraphs of 5-connected graphs
• The number of vertices of degree 5 in a contraction-critically 5-connected graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043641)