The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs

DOI10.1002/jgt.21741zbMath1288.05140OpenAlexW1826916262MaRDI QIDQ5417828

Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell

Publication date: 22 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21741

zbMATH Keywords

5-connected graphcontraction-critically 5-connecteddegree 5 vertex

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

Small components of the 5-subgraph of a contraction-critically 5-connected graph

Cites Work

• Unnamed Item
• Vertices of degree 5 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
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• The Existence and Construction of Balanced Incomplete Block Designs
• Uncontractable 4-connected graphs
• A Balanced Incomplete Block Design
• Average degree and contractibility

This page was built for publication: The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs