Szczegóły publikacji
Opis bibliograficzny
On the structure of the set of cycle lengths in a hamiltonian graph / Antoni MARCZYK // Discrete Mathematics ; ISSN 0012-365X. — 2004 — vol. 286 iss. 1–2, s. 133–140. — Bibliogr. s. 140, Abstr. — Publikacja dostępna online od: 2004-07-07. — Cycles and Colourings (C&C) : 9-14 September 2001, Stara Lesna, Slovakia
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 19253 |
|---|---|
| Data dodania do BaDAP | 2005-01-26 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.disc.2003.11.053 |
| Rok publikacji | 2004 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics |
Abstract
We study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and nonadjacent vertices x, y whose degree sum satisfies d(x)+d(y)greater than or equal ton+z, where zgreater than or equal to1. We prove that this set contains all integers between 3 and 4n+4z+32/19. This improves and generalizes some results of Faudree et al. (Discuss. Math. Graph Theory 16 (1996) 27) and Schelten and Schiermeyer (Discrete Appl. Math. 79 (1997) 201). We also show that if zgreater than or equal to5/18n then G contains a cycle of length p for every p satisfying 3less than or equal topless than or equal ton/2+z/2+1. (C) 2004 Elsevier B.V. All rights reserved.
