Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Independent Detour Transversals in 3-Deficient Digraphs

Susan van AardtMarietjie FrickJoy Singleton — 2013

Discussiones Mathematicae Graph Theory

In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour transversal (IDT), i.e. an independent set which intersects every longest path. Havet [Stable set meeting every longest path, Discrete Math. 289 (2004) 169-173] showed that the conjecture holds for digraphs with independence number two. A digraph is p-deficient...

Page 1

Download Results (CSV)