The removable edges and the contractible subgraphs of 5-connected graphs

DOI10.1007/s00373-013-1368-yzbMath1306.05132OpenAlexW2065204892MaRDI QIDQ489362

Xiaofeng Guo, Kiyoshi Ando, Chengfu Qin

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-1368-y

zbMATH Keywords

5-connected graphcontractible subgraphminor minimalremovable edge

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some structural properties of minimally contraction-critically 5-connected graphs
• Contractions, cycle double covers, and cyclic colorings in locally connected graphs
• How to contract an essentially 6-connected graph to a 5-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
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Vertices of degree 5 in a contraction critically 5-connected graph
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• A local structure theorem on 5-connected graphs
• Cyclic coloration of 3-polytopes
• Average degree and contractibility

This page was built for publication: The removable edges and the contractible subgraphs of 5-connected graphs