Szczegóły publikacji
Opis bibliograficzny
On odd and semi-odd linear partitions of cubic graphs / Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam P. WOJDA // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099 . — 2009 — vol. 29, s. 275–292. — Bibliogr. s. 291–292, Abstr. — 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) : 16–21 September 2007, Karpacz, Poland
Autorzy (4)
- Fouquet Jean-Luc
- Thuillier Henri
- Vanherpe J. M.
- AGHWojda Adam Paweł
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 47093 |
|---|---|
| Data dodania do BaDAP | 2009-09-28 |
| Tekst źródłowy | URL |
| DOI | 10.7151/dmgt.1447 |
| Rok publikacji | 2009 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discussiones Mathematicae, Graph Theory |
Abstract
A linear forest is a graph whose connected components are chordless paths. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. In this paper we consider linear partition of cubic simple graphs for which it is well known that la(G) = 2. A linear partition L = (LB,L R) is said to be odd whenever each path of LB ∪ L R has odd length and semi-odd whenever each path of LB (or each path of LR) has odd length. In [2] Aldred and Wormald showed that a cubic graph G is 3- edge colourable if and only if G has an odd linear partition. We give here more precise results and we study moreover relationship between semi-odd linear partitions and perfect matchings.
