Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4

An oriented graph is a digraph that does not contain a directed cycle of length two. An (oriented) graph $D$ is $H$-free if $D$ does not contain $H$ as an induced sub(di)graph. The Gyárfás-Sumner conjecture is a widely-open conjecture on simple graphs, which states that for any forest $F$, there is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Electronic journal of combinatorics 2023-09, Vol.30 (3)
Hauptverfasser:	Cook, Linda, Masařík, Tomáš, Pilipczuk, Marcin, Reinald, Amadeus, Souza, Uéverton S.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!