Szczegóły publikacji
Opis bibliograficzny
Cycles in hamiltonian graphs of prescribed maximum degree / Antoni MARCZYK, Mariusz WOŹNIAK // Discrete Mathematics ; ISSN 0012-365X. — 2003 — vol. 266 iss. 1–3, s. 321–326. — Bibliogr. s. 326, Abstr. — 18th British Combinatorial Conference : Brighton, 1–6 July 2006
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 17131 |
|---|---|
| Data dodania do BaDAP | 2004-09-01 |
| Tekst źródłowy | URL |
| DOI | 10.1016/S0012-365X(02)00817-8 |
| Rok publikacji | 2003 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics |
Abstract
Let G be a hamiltonian graph G of order n and maximum degree Delta, and let C(G) denote the set of cycle lengths occurring in G. It is easy to see that \C(G) greater than or equal to Delta - 1. In this paper, we prove that if Delta > n/2, then \C(G)j greater than or equal to (n + Delta - 3)/2. We also show that for every Delta greater than or equal to 2 there is a graph G of order n greater than or equal to 2Delta such that \C(G)\ = Delta - 1, and the lower bound in case Delta > n/2 is best possible.
