Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen

Faßbender, Bert (1989) Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen.
Published in: Mathematische Nachrichten Vol. 142 (1). pp. 287-296.

Abstract

Let G be a simple 2-connected graph of order u such that the degree-sum of any two nonadjacent vertices is at least {2 over 3} u, and let C be a non-dominating longest cycle in G. We show that G-C is a complete graph and V(G) contains a nonempty proper subset S such that G-S has exactly |S|+1 components. From this result a sufficient condition for the existence of Hamilton cycles in 1-tough graphs can be obtained.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr87-046
Depositing User: Bert Faßbender
Date Deposited: 02 Apr 2001 00:00
Last Modified: 24 Oct 2011 14:10
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/46