On the number of 4-contractible edges in 4-connected graphs

DOI10.1016/j.jctb.2008.04.003zbMath1202.05072OpenAlexW1978643805MaRDI QIDQ2519017

Kiyoshi Ando, Matthias Kriesell, Ken-ichi Kawarabayashi, Yoshimi Egawa

Publication date: 21 January 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.04.003

zbMATH Keywords

connectivityaverage degreecontractible edge

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (4)

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph ⋮ 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 ⋮ THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS ⋮ Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Contractions, cycle double covers, and cyclic colorings in locally connected graphs
• Generalizaions of critical connectivity of graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• A recursive characterization of the 4-connected graphs
• The Existence and Construction of Balanced Incomplete Block Designs
• Average degree and contractibility

This page was built for publication: On the number of 4-contractible edges in 4-connected graphs