Szczegóły publikacji
Opis bibliograficzny
Decomposition of bipartite graphs into closed trails / Sylwia CICHACZ, Mirko Horňák // Czechoslovak Mathematical Journal ; ISSN 0011-4642 . — 2009 — vol. 59 iss. 1, s. 129–144. — Bibliogr. s. 144, Abstr.
Autorzy (2)
- AGHCichacz-Przeniosło Sylwia
- Horňak Mirko
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 48407 |
|---|---|
| Data dodania do BaDAP | 2009-11-13 |
| DOI | 10.1007/s10587-009-0009-3 |
| Rok publikacji | 2009 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Czechoslovak Mathematical Journal |
Abstract
Let Lct(G) denote the set of all lengths of closed trails that exist in an even graph G. A sequence (t 1,..., t p ) of elements of Lct(G) adding up to |E(G)| is G-realisable provided there is a sequence (T 1,..., t p ) of pairwise edge-disjoint closed trails in G such that T i is of length T i for i = 1,..., p. The graph G is arbitrarily decomposable into closed trails if all possible sequences are G-realisable. In the paper it is proved that if a ≥ 1 is an odd integer and M a,a is a perfect matching in K a,a , then the graph K a,a -M a,a is arbitrarily decomposable into closed trails. © 2009 Mathematical Institute, Academy of Sciences of Czech Republic.
