Szczegóły publikacji
Opis bibliograficzny
Decomposition of complete bipartite graphs into open trails / Sylwia CICHACZ, Agnieszka GÖRLICH // Electronic Notes in Discrete Mathematics ; ISSN 1571-0653. — 2006 — vol. 24, s. 53–55. — Bibliogr. s. 55, Abstr.
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 31562 |
|---|---|
| Data dodania do BaDAP | 2007-02-17 |
| DOI | 10.1016/j.endm.2006.06.009 |
| Rok publikacji | 2006 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Electronic Notes in Discrete Mathematics |
Abstract
It has been showed in [Horňák, M., and M. Woźniak, Decomposition of complete bipartite even graphs into closed trails, Czechoslovak Mathematical Journal 128 (2003) 127-134] that any bipartite graph Ka, b, where a, b are even is decomposable into closed trails of prescribed even lengths. In this article we consider the corresponding question for open trails. We show that for even a and b any complete bipartite graph Ka, b is decomposable into open trails of arbitrarily lengths (less than ab) whenever these lengths sum up to the size of the graph Ka, b. Let Ka, a ′ : = Ka, a - Ia for any 1-factor Ia. We also prove that for odd aKa, a ′ can be decomposed in a similar manner. © 2006 Elsevier B.V. All rights reserved.
