Szczegóły publikacji
Opis bibliograficzny
Graphs with every $k$-matching in a Hamiltonian cycle $\mbox{}^{*}$ / Grzegorz GANCARZEWICZ, A. Paweł WOJDA // Discrete Mathematics ; ISSN 0012-365X. — 2000 — vol. 213 iss. 1–3, s. 141–151. — Bibliogr. s. 151, Abstr. — Conference on Selected Topics in Discrete Mathematics : Warsaw, Poland, 26 August – 28 September 1998
Autorzy (2)
Dane bibliometryczne
| ID BaDAP | 1586 |
|---|---|
| Data dodania do BaDAP | 2001-04-18 |
| Tekst źródłowy | URL |
| DOI | 10.1016/S0012-365X(99)00174-0 |
| Rok publikacji | 2000 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics |
Abstract
Using the property that being s-edge-Hamiltonian is (n + s)-stable, we characterize all 3-connected graphs G of order n greater than or equal to 3, such that for all vertices x, y is an element of V(G) we have d(x, y) = 2 double right arrow max{d(x),d(y)} greater than or equal to n + k/2 and there is a k-matching M subset of G, (k greater than or equal to 0) which is not contained in any Hamiltonian cycle of G. (C) 2000 Elsevier Science B.V. All rights reserved.
