Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)

DOI10.1016/j.disc.2021.112416zbMath1466.05109OpenAlexW3154352320MaRDI QIDQ2032743

Kiyoshi Ando

Publication date: 14 June 2021

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

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

zbMATH Keywords

minimum degree\(k\)-connected graph\(k\)-contractible edge

Mathematics Subject Classification ID

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

Related Items (1)

A constructive characterization of 4-connected graphs

Cites Work

• Contractible edges in 3-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• Unnamed Item

This page was built for publication: Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)