On path partitions and colourings in digraphs
From MaRDI portal
Publication:3655147
Recommendations
Cites work
- scientific article; zbMATH DE number 3165195 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A short proof of the existence of k-saturated partitions of partially ordered sets
- Berge's conjecture on directed path partitions -- a survey
- Extending the Greene-Kleitman theorem to directed graphs
- Network flows. Theory, algorithms, and applications.
- On chain and antichain families of a partially ordered set
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
- Path partitions and packs of acyclic digraphs
- Proof of Berge's strong path partition conjecture for \(k=2\)
- Some partitions associated with a partially ordered set
- The structure of Sperner k-families
- k-optimal partitions of a directed graph
Cited in
(9)- On Greene-Kleitman's theorem for general digraphs
- Polyunsaturated posets and graphs and the Greene-Kleitman theorem
- Berge's conjecture on directed path partitions -- a survey
- Colourings, homomorphisms, and partitions of transitive digraphs
- On greene's theorem for digraphs
- Path colorings in bipartite graphs
- Paths with two blocks in k-chromatic digraphs
- scientific article; zbMATH DE number 202590 (Why is no real title available?)
- Path partitions and packs of acyclic digraphs
This page was built for publication: On path partitions and colourings in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655147)