Contractile triples in 3-connected graphs

William McCuaig, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)


We prove that every 3-connected graph G of order at least nine has two adjacent edges xy and yz such that the graph obtained from G by contracting x, y, and z into a single vertex is also 3-connected.

Original languageEnglish
Pages (from-to)308-314
Number of pages7
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - 1994 Mar

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Contractile triples in 3-connected graphs'. Together they form a unique fingerprint.

Cite this