On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs
- 30 April 1986
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 7 (2) , 115-118
- https://doi.org/10.1016/s0195-6698(86)80036-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Extending Greene's theorem to directed graphsJournal of Combinatorial Theory, Series A, 1983
- k-optimal Partitions of a Directed GraphEuropean Journal of Combinatorics, 1982
- Extending the Greene-Kleitman theorem to directed graphsJournal of Combinatorial Theory, Series A, 1981
- Hypotraceable digraphsJournal of Graph Theory, 1980
- On chain and antichain families of a partially ordered setJournal of Combinatorial Theory, Series B, 1980
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- GRAPHS AND HYPERGRAPHSBulletin of the London Mathematical Society, 1974
- Nombre chromatique et plus longs chemins d'un grapheRevue française d'informatique et de recherche opérationnelle, 1967
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950