- Tytuł:
- Every 8-Traceable Oriented Graph Is Traceable
- Autorzy:
- Aardt, Susan A. van
- Powiązania:
- https://bibliotekanauki.pl/articles/31341593.pdf
- Data publikacji:
- 2017-11-27
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
oriented graph
traceable
hypotraceable
k-traceable
generalized tournament - Opis:
- A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented graphs that are nontraceable. We show that every 8-traceable oriented graph is traceable.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 963-973
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł