| Autor: |
Liu Wenzhong, Li Panpan |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 35-49 (2020) |
| Druh dokumentu: |
article |
| ISSN: |
2083-5892 |
| DOI: |
10.7151/dmgt.2132 |
| Popis: |
A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
