The directed path partition conjecture
From MaRDI portal
Publication:5492647
DOI10.7151/dmgt.1286zbMath1118.05040WikidataQ122942046 ScholiaQ122942046MaRDI QIDQ5492647
Ortrud R. Oellermann, Gcina Dlamini, Susan A. van Aardt, Marietjie Frick, Jean E. Dunbar
Publication date: 16 October 2006
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1286
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Computational results on the traceability of oriented graphs of small order, A note on a cycle partition problem, Cycles in \(k\)-traceable oriented graphs, A linear bound towards the traceability conjecture, Traceability of \(k\)-traceable oriented graphs, On a cycle partition problem, Extended path partition conjecture for semicomplete and acyclic compositions, Independent sets and non-augmentable paths in generalizations of tournaments, Longest path partitions in generalizations of tournaments, Quasi-Transitive Digraphs and Their Extensions