Generating cycles in graphs with at most one end

Link:

https://doi.org/10.1002/jgt.10098

Autor/in:

Bruhn, Henning

Erscheinungsjahr:

2003

Medientyp:

Text

Schlagworte:

Cycle space
Infinite graphs
Tutte's theorem

Beschreibung:

Answering a question of Halin, we prove that in a 3-connected graph with at most one end the cycle space is generated by induced non-separating cycles. © 2003 Wiley Periodicals, Inc.

Lizenz:

info:eu-repo/semantics/closedAccess

Quellsystem:

Forschungsinformationssystem der UHH

Interne Metadaten

Quelldatensatz: oai:www.edit.fis.uni-hamburg.de:publications/64357c18-cfdb-4e4a-870c-3cacb25ee08a