On k-optimum dipath partitions and partial k-colourings of acyclic digraphs

DOI10.1016/S0195-6698(86)80036-1zbMath0603.05020OpenAlexW2043162283MaRDI QIDQ1082350

Kathie Cameron

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(86)80036-1

zbMATH Keywords

independent setsmin-max relationsdisjoint dipaths

Mathematics Subject Classification ID

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

Related Items (10)

Motivations and history of some of my conjectures ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ Coflow polyhedra ⋮ A unified approach to known and unknown cases of Berge's conjecture ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ 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
• Unnamed Item
• Unnamed Item
• 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
• Coflow polyhedra
• Extending Greene's theorem to directed graphs
• A decomposition theorem for partially ordered sets
• Hypotraceable digraphs
• Nombre chromatique et plus longs chemins d'un graphe
• The structure of Sperner k-families

This page was built for publication: On k-optimum dipath partitions and partial k-colourings of acyclic digraphs