Non-contractible edges in a 3-connected graph

Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu

Research output: Contribution to journal › Article

2 Citations (Scopus)

Abstract

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
JournalCombinatorica
Volume15
Issue number3
DOIs
Publication statusPublished - 1995 Sep

Fingerprint

Connected graph
Contraction
Upper bound

Keywords

  • Mathemacics Subject Classification (1991): 05C40

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Non-contractible edges in a 3-connected graph. / Egawa, Yoshimi; Ota, Katsuhiro; Saito, Akira; Yu, Xingxing.

In: Combinatorica, Vol. 15, No. 3, 09.1995, p. 357-364.

Research output: Contribution to journal › Article

Egawa, Y, Ota, K, Saito, A & Yu, X 1995, 'Non-contractible edges in a 3-connected graph', Combinatorica, vol. 15, no. 3, pp. 357-364. https://doi.org/10.1007/BF01299741
Egawa Y, Ota K, Saito A, Yu X. Non-contractible edges in a 3-connected graph. Combinatorica. 1995 Sep;15(3):357-364. https://doi.org/10.1007/BF01299741
Egawa, Yoshimi ; Ota, Katsuhiro ; Saito, Akira ; Yu, Xingxing. / Non-contractible edges in a 3-connected graph. In: Combinatorica. 1995 ; Vol. 15, No. 3. pp. 357-364.
@article{4992505fcf404de08663ec38ccceac16,
title = "Non-contractible edges in a 3-connected graph",
abstract = "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.",
keywords = "Mathemacics Subject Classification (1991): 05C40",
author = "Yoshimi Egawa and Katsuhiro Ota and Akira Saito and Xingxing Yu",
year = "1995",
month = "9",
doi = "10.1007/BF01299741",
language = "English",
volume = "15",
pages = "357--364",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "3",

}

TY - JOUR

T1 - Non-contractible edges in a 3-connected graph

AU - Egawa, Yoshimi

AU - Ota, Katsuhiro

AU - Saito, Akira

AU - Yu, Xingxing

PY - 1995/9

Y1 - 1995/9

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

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

KW - Mathemacics Subject Classification (1991): 05C40

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

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

U2 - 10.1007/BF01299741

DO - 10.1007/BF01299741

M3 - Article

AN - SCOPUS:0012960835

VL - 15

SP - 357

EP - 364

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 3

ER -

Access to Document