Non-contractible edges in a 3-connected graph

Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


An edge e in a 3-connected graph G is contractible if the contraction of e in G results in a 3-connected graph; otherwise e is non-contractible. In this paper, we prove that the number of non-contractible edges in a 3-connected graph of order p≥5 is at most {Mathematical expression} and show that this upper bound is the best possible for infinitely many values of p.

Original languageEnglish
Pages (from-to)357-364
Number of pages8
Issue number3
Publication statusPublished - 1995 Sept 1


  • Mathemacics Subject Classification (1991): 05C40

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics


Dive into the research topics of 'Non-contractible edges in a 3-connected graph'. Together they form a unique fingerprint.

Cite this