k-optimal partitions of a directed graph

DOI10.1016/S0195-6698(82)80022-XzbMath0501.05037MaRDI QIDQ1172068

Claude Berge

Publication date: 1982

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

path partitiondisjoint stable setspartial colouring

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)

Related Items

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Linial's conjecture for arc-spine digraphs ⋮ Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) ⋮ Motivations and history of some of my conjectures ⋮ On greene's theorem for digraphs ⋮ Minmax relations for cyclically ordered digraphs ⋮ A note on the Lie complexity and beyond ⋮ An upper bound of the number of distinct powers in binary words ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ On the strong and the semi-strong path partition conjecture ⋮ On Linial's conjecture for spine digraphs ⋮ A unified approach to known and unknown cases of Berge's conjecture ⋮ On the strong path partition conjecture of Berge ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ On the Berge's strong path partition conjecture ⋮ On Path Partitions and Colourings in Digraphs ⋮ Path Partitions, Cycle Covers and Integer Decomposition ⋮ Some sequences associated with combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Some partitions associated with a partially ordered set
• Covering digraphs by paths
• A decomposition theorem for partially ordered sets
• Nombre chromatique et plus longs chemins d'un graphe
• The structure of Sperner k-families

This page was built for publication: k-optimal partitions of a directed graph