k-optimal Partitions of a Directed Graph
- 30 June 1982
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 3 (2) , 97-101
- https://doi.org/10.1016/s0195-6698(82)80022-x
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Diperfect graphsCombinatorica, 1982
- Extending the Greene-Kleitman theorem to directed graphsJournal of Combinatorial Theory, Series A, 1981
- On chain and antichain families of a partially ordered setJournal of Combinatorial Theory, Series B, 1980
- A short proof of the existence of k-saturated partitions of partially ordered setsAdvances in Mathematics, 1979
- Covering digraphs by pathsDiscrete Mathematics, 1978
- Some partitions associated with a partially ordered setJournal of Combinatorial Theory, Series A, 1976
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- 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