Eindeutige Faktoren von Graphen - maximale Kantenzahlen und Extremalgraphen

We are given a set V of vertices and a class of graphs on V. In this paper we examine the following question: What is the maximum number of edges in a graph on V, which contains exactly one graph of the class as a subgraph? What can we say about the corresponding extremal graphs? In this thesis we examine graphs with unique f-factors, graphs with unique k-factors, graphs with unique Hamilton cycles or Hamilton paths, and graphs with a unique subgraph on a given (small and fixed) number of edges.

Grantor dc:publisher

Publikationsserver der RWTH Aachen University

Year dc:date

2000

Author dc:creator

• Johann, Petra

Contributors dc:contributor

• Triesch, Eberhard

• info:eu-repo/classification/ddc/510
• Mathematik
• Graphentheorie
• Extremalproblem

Statement dc:rights

• info:eu-repo/semantics/openAccess

Language dc:language

ger

Identifier

https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118353%22

OAI record oai:identifier

https://publications.rwth-aachen.de/oai2d?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Apublications.rwth-aachen.de%3A56234