A constructive characterization of contraction critical 8-connected graphs with minimum degree 9

DOI10.1016/j.disc.2019.06.015zbMath1419.05115OpenAlexW2954880483WikidataQ127574884 ScholiaQ127574884MaRDI QIDQ2324494

Kiyoshi Ando, Chengfu Qin, Wei-Hua He

Publication date: 11 September 2019

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

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

zbMATH Keywords

characterizationcontraction critical8-connected graphminimum degree 9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some structural properties of minimally contraction-critically 5-connected graphs
• The number of vertices of degree 7 in a contraction-critical 7-connected graph
• Some properties of contraction-critical 5-connected graphs
• A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
• 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 6 in a contraction critically 6-connected graph
• 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
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• Uncontractable 4-connected graphs
• Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph

This page was built for publication: A constructive characterization of contraction critical 8-connected graphs with minimum degree 9