The 3‐connected graphs having a longest cycle containing only three contractible edges

R. E L Aldred, Robert L. Hemminger, Katsuhiro Ota

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.

Original languageEnglish
Pages (from-to)361-371
Number of pages11
JournalJournal of Graph Theory
Volume17
Issue number3
DOIs
Publication statusPublished - 1993

Fingerprint

Contractible Edge
Long Cycle
Graph in graph theory
Exception

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

The 3‐connected graphs having a longest cycle containing only three contractible edges. / Aldred, R. E L; Hemminger, Robert L.; Ota, Katsuhiro.

In: Journal of Graph Theory, Vol. 17, No. 3, 1993, p. 361-371.

Research output: Contribution to journalArticle

@article{824dcfc27d8d4827b0d6285bd3c74fc8,
title = "The 3‐connected graphs having a longest cycle containing only three contractible edges",
abstract = "It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. {\circledC} 1993 John Wiley & Sons, Inc.",
author = "Aldred, {R. E L} and Hemminger, {Robert L.} and Katsuhiro Ota",
year = "1993",
doi = "10.1002/jgt.3190170310",
language = "English",
volume = "17",
pages = "361--371",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - The 3‐connected graphs having a longest cycle containing only three contractible edges

AU - Aldred, R. E L

AU - Hemminger, Robert L.

AU - Ota, Katsuhiro

PY - 1993

Y1 - 1993

N2 - It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.

AB - It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.

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

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

U2 - 10.1002/jgt.3190170310

DO - 10.1002/jgt.3190170310

M3 - Article

AN - SCOPUS:84987486538

VL - 17

SP - 361

EP - 371

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -