Algorithms for maximum k‐colorings and k‐coverings of transitive graphs
- 1 January 1987
- Vol. 17 (4) , 465-470
- https://doi.org/10.1002/net.3230170407
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Path partitions and packs of acyclic digraphsPacific Journal of Mathematics, 1985
- Extending Greene's theorem to directed graphsJournal of Combinatorial Theory, Series A, 1983
- 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
- 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
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963