Minimal Cycle Bases of Outerplanar Graphs

Josef Leydold; Peter F. Stadler

Minimal Cycle Bases of Outerplanar Graphs

Publikation: Wissenschaftliche Fachzeitschrift › Originalbeitrag in Fachzeitschrift › Begutachtung

Abstract

2-connected outerplanar graphs have a unique minimal cycle basis with length
2jEj − jV j. They are the only Hamiltonian graphs with a cycle basis of this
length.

Originalsprache	Englisch
Seiten (von - bis)	209 - 222
Fachzeitschrift	Journal of Combinatorics
Ausgabenummer	5
Publikationsstatus	Veröffentlicht - 1 Juni 1998

Verfügbarkeit prüfen

Katalog der Universitätsbibliothek

Andere Dateien und Links

http://www.emis.de/journals/EJC/Volume_5/PDF/v5i1r16.pdf

Zitat

@article{910b67bf3f014747a8aefaf69a39d248,

title = "Minimal Cycle Bases of Outerplanar Graphs",

abstract = "2-connected outerplanar graphs have a unique minimal cycle basis with length 2jEj − jV j. They are the only Hamiltonian graphs with a cycle basis of this length.",

author = "Josef Leydold and Stadler, {Peter F.}",

year = "1998",

month = jun,

day = "1",

language = "English",

pages = "209 -- 222",

journal = "Journal of Combinatorics",

issn = "2156-3527",

publisher = "International Press, Inc.",

number = "5",

}

TY - JOUR

T1 - Minimal Cycle Bases of Outerplanar Graphs

AU - Leydold, Josef

AU - Stadler, Peter F.

PY - 1998/6/1

Y1 - 1998/6/1

N2 - 2-connected outerplanar graphs have a unique minimal cycle basis with length 2jEj − jV j. They are the only Hamiltonian graphs with a cycle basis of this length.

AB - 2-connected outerplanar graphs have a unique minimal cycle basis with length 2jEj − jV j. They are the only Hamiltonian graphs with a cycle basis of this length.

UR - http://www.emis.de/journals/EJC/Volume_5/PDF/v5i1r16.pdf

M3 - Journal article

SN - 2156-3527

SP - 209

EP - 222

JO - Journal of Combinatorics

JF - Journal of Combinatorics

IS - 5

ER -