Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles

DOI10.1007/S00373-018-1924-6zbMath1402.05102OpenAlexW2884562754MaRDI QIDQ1756041

Keiko Kotani, Shunsuke Nakamura, Yoshimi Egawa

Publication date: 11 January 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1924-6

zbMATH Keywords

triangle4-connected graphcontractible edge

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
• Edges not contained in triangles and the number of contractible edges 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
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES

This page was built for publication: Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles