- Tytuł:
- The directed path partition conjecture
- Autorzy:
-
Frick, Marietjie
van Aardt, Susan
Dlamini, Gcina
Dunbar, Jean
Oellermann, Ortrud - Powiązania:
- https://bibliotekanauki.pl/articles/744375.pdf
- Data publikacji:
- 2005
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
longest path
Path Partition Conjecture
vertex partition
digraph
prismatic colouring - Opis:
- The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path with more than λ vertices then, for every pair (a,b) of positive integers with λ = a+b, there exists a vertex partition (A,B) of D such that no path in D⟨A⟩ has more than a vertices and no path in D⟨B⟩ has more than b vertices. We develop methods for finding the desired partitions for various classes of digraphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 331-343
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł