Algorithms for maximum k‐colorings and k‐coverings of transitive graphs

Networks

Volumn 17, Issue 4, 1987, Pages 465-470

  Gavril, Fǎnicǎ ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Ministry of Defence Government of Israel   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84986974371     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230170407     Document Type: Article

References (12)

1. Path partitions, and packs of acyclic digraphs
2. Permutation graphs and transitive graphs
3. On chain and antichain families of a partially ordered set
4. Some partitions associated with a partially ordered set
5. The structure of Sperner k‐families
6. Ordered Sets
7. Extending Greene's theorem to directed graphs
8. Extending the Greene‐Kleitman theorem to directed graphs
9. Transitive orientation of graphs and identification of permutation graphs