Contractible edges in a 4-connected graph with vertices of degree greater than four

DOI10.1007/s00373-007-0699-yzbMath1120.05050OpenAlexW2055198385MaRDI QIDQ2373429

Yoshimi Egawa, Kiyoshi Ando

Publication date: 19 July 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0699-y

zbMATH Keywords

Contractible edge4-Connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (8)

A chain theorem for 4-connected graphs ⋮ Contractible edges and liftable vertices in a 4-connected graph ⋮ Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph ⋮ Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles ⋮ A local structure theorem on 5-connected graphs ⋮ Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph ⋮ Edges not contained in triangles and the number of contractible edges in a 4-connected graph ⋮ THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS

Cites Work

• Uncontractable 4-connected graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Contractible edges in a 4-connected graph with vertices of degree greater than four