Contractile triples in 3-connected graphs

William McCuaig, Katsuhiro Ota

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

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
Volume60
Issue number2
DOIs
Publication statusPublished - 1994

Fingerprint

Connected graph
Adjacent
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

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

Cite this

Contractile triples in 3-connected graphs. / McCuaig, William; Ota, Katsuhiro.

In: Journal of Combinatorial Theory, Series B, Vol. 60, No. 2, 1994, p. 308-314.

Research output: Contribution to journalArticle

@article{ccf8db1de89d4352b267003ffa144f17,
title = "Contractile triples in 3-connected graphs",
abstract = "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.",
author = "William McCuaig and Katsuhiro Ota",
year = "1994",
doi = "10.1006/jctb.1994.1022",
language = "English",
volume = "60",
pages = "308--314",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Contractile triples in 3-connected graphs

AU - McCuaig, William

AU - Ota, Katsuhiro

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0000467302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000467302&partnerID=8YFLogxK

U2 - 10.1006/jctb.1994.1022

DO - 10.1006/jctb.1994.1022

M3 - Article

VL - 60

SP - 308

EP - 314

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -