论文信息 - Algorithms for maximum k-colorings and k-coverings of transitive graphs

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

Consider a graph G and a positive integer k. The maximum k-coloring problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The maximum k-covering problem is to find k disjoint cliques covering a maximum number of vertices. The present paper contains polynomial time algorithms for finding maximum k-colorings and maximum k-coverings of transitive graphs.

Fanica Gavril | F. Gavril

[1] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[2] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.

[3] A. J. Hoffman,et al. PATH PARTITIONS AND PACKS OF ACYCLIC DIGRAPHS , 1985 .

[4] Daniel J. Kleitman,et al. The Structure of Sperner k-Families , 1976, J. Comb. Theory, Ser. A.

[5] András Frank,et al. On chain and antichain families of a partially ordered set , 1980, J. Comb. Theory, Ser. B.

[6] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Curtis Greene. Some Partitions Associated with a Partially Ordered Set , 1976, J. Comb. Theory, Ser. A.

[9] Alan J. Hoffman. Extending Greene's Theorem to Directed Graphs , 1983, J. Comb. Theory, Ser. A.

[10] Nathan Linial. Extending the Greene-Kleitman Theorem to Directed Graphs , 1981, J. Comb. Theory, Ser. A.