On path partitions and colourings in digraphs
DOI10.1007/978-3-642-02029-2_13zbMATH Open1194.05048OpenAlexW1567474719MaRDI QIDQ3655147FDOQ3655147
Authors: Irith Ben-Arroyo Hartman 
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_13
Recommendations
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A short proof of the existence of k-saturated partitions of partially ordered sets
- Extending the Greene-Kleitman theorem to directed graphs
- k-optimal partitions of a directed graph
- Proof of Berge's strong path partition conjecture for \(k=2\)
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- The structure of Sperner k-families
- On chain and antichain families of a partially ordered set
- Some partitions associated with a partially ordered set
- Title not available (Why is that?)
- Path partitions and packs of acyclic digraphs
- Berge's conjecture on directed path partitions -- a survey
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
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
- Title not available (Why is that?)
- 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)
