Edges not contained in triangles and the number of contractible edges in a 4-connected graph

DOI10.1016/j.disc.2007.10.014zbMath1175.05071OpenAlexW2012522460MaRDI QIDQ998425

Yoshimi Egawa, Kiyoshi Ando

Publication date: 28 January 2009

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

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

zbMATH Keywords

triangle4-connected graphcontractible edge

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges ⋮ Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles ⋮ 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

Cites Work

• Unnamed Item
• Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• Uncontractable 4-connected graphs
• On the number of shredders
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

This page was built for publication: Edges not contained in triangles and the number of contractible edges in a 4-connected graph