On Path Partitions and Colourings in Digraphs

DOI10.1007/978-3-642-02029-2_13zbMath1194.05048OpenAlexW1567474719MaRDI QIDQ3655147

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path partitions and packs of acyclic digraphs
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• A short proof of the existence of k-saturated partitions of partially ordered sets
• On chain and antichain families of a partially ordered set
• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• Some partitions associated with a partially ordered set
• Berge's conjecture on directed path partitions -- a survey
• Proof of Berge's strong path partition conjecture for \(k=2\)
• A decomposition theorem for partially ordered sets
• The structure of Sperner k-families

This page was built for publication: On Path Partitions and Colourings in Digraphs