The directed path partition conjecture

DOI10.7151/dmgt.1286zbMath1118.05040OpenAlexW2006016709WikidataQ122942046 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

zbMATH Keywords

digraphvertex partitionlongest pathpath partition conjectureprismatic colouring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Extended path partition conjecture for semicomplete and acyclic compositions ⋮ Computational results on the traceability of oriented graphs of small order ⋮ A linear bound towards the traceability conjecture ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ A note on a cycle partition problem ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ Longest path partitions in generalizations of tournaments ⋮ On a cycle partition problem ⋮ Quasi-Transitive Digraphs and Their Extensions

This page was built for publication: The directed path partition conjecture