The directed path partition conjecture

DOI10.7151/DMGT.1286MaRDI QIDQ5492647zbMATH OpenOpenAlexWikidataFDO

Authors Marietjie Frick, Susan Van Aardt, Gcina Dlamini, Ortrud R. Oellermann, 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

digraphlongest pathpath partition conjectureprismatic colouringvertex partition

Mathematics Subject Classification ID

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

Recommendations

• The Path Partition Conjecture is true for some generalizations of tournaments
• Longest path partitions in generalizations of tournaments
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
• A survey of the path partition conjecture
• Path partitions and packs of acyclic digraphs

Cited in

(22)

• Decompositions of digraphs into paths and cycles
• The Path Partition Conjecture is true for some generalizations of tournaments
• \(\alpha\)-diperfect digraphs
• Linial's conjecture for arc-spine digraphs
• 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
• Significant differences between path partitions in directed and undirected graphs
• Quasi-transitive digraphs and their extensions
• scientific article; zbMATH DE number 3900787 (Why is no real title available?)
• Computational results on the traceability of oriented graphs of small order
• On Linial's conjecture for spine digraphs
• On partitioning the edges of an infinite digraph into directed cycles
• A note on a cycle partition problem
• The Path Partition Conjecture
• A proof of the two-path conjecture
• Cycles in \(k\)-traceable oriented graphs
• Some digraph classes that meet the directed path partition conjecture
• A linear bound towards the traceability conjecture
• Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
• Traceability of k-traceable oriented graphs
• On a cycle partition problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492647)