Approximating minimum cocolorings

Information Processing Letters

Volumn 84, Issue 5, 2002, Pages 285-290

  Fomin, Fedor V ^a   Kratsch, Dieter ^b   Novelli, Jean Christophe ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIV LILLE   (France)

Author keywords

Approximation algorithms; Graphs; Partially ordered sets; Sequences

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; SET THEORY;

COCOLORING PROBLEMS;

GRAPH THEORY;

EID: 0037121487     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00288-0     Document Type: Article

References (20)

1. Alon N., Krivelevich M., Sudakov B. Subgraphs with a large cochromatic number. J. Graph Theory. 25:1997;295-297.
2. Brandstädt A., Kratsch D. On partitions of permutations into increasing and decreasing subsequences. Elektron. Inform. Kybernet. 22:1986;263-273.
3. Brandstädt A., Le V.B., Spinrad J.P. Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. 1999;SIAM, Philadelphia, PA.
4. Broere I., Burger M. Critically cochromatic graphs. J. Graph Theory. 13:1989;23-28.
5. Cheriyan J., Ravi R. Approximation algorithms for network problems. 1998;. manuscript.
6. Erdos P., Gimbel J. Some problems and results in cochromatic theory. Quo Vadis, Graph Theory? 1993;261-264 North-Holland, Amsterdam.
7. Erdos P., Gimbel J., Kratsch D. Some extremal results in cochromatic and dichromatic theory. J. Graph Theory. 15:1991;579-585.
8. Erdos P., Gimbel J., Straight H.J. Chromatic number versus cochromatic number in graphs with bounded clique number. European J. Combin. 11:1990;235-240.
9. Frank A. On chain and antichain families of a partially ordered set. J. Combin. Theory Ser. B. 29:1980;176-184.
10. Gimbel J., Kratsch D., Stewart L. On cocolourings and cochromatic numbers of graphs. Discrete Appl. Math. 48:1994;111-127.
11. Gimbel J., Straight H.J. Some topics in cochromatic theory. Graphs Combin. 3:1987;255-265.
12. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
13. Greene C. Some partitions associated with a partially ordered set. J. Combin. Theory Ser. A. 20:1976;69-79.
14. Greene C., Kleitman D.J. The structure of Sperner k -families. J. Combin. Theory Ser. A. 20:1976;41-68.
15. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer, Berlin.
16. Johnson D.S. Approximation algorithms for combinatorial problems. 5th Annual ACM Symposium on the Theory of Computing (Austin, TX, 1973) J. Comput. System Sci. 9:1974;256-278.
17. Lesniak-Foster L.M., Straight H.J. The cochromatic number of a graph. Ars Combin. 3:1977;39-45.
18. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13:1975;383-390.
19. Straight H.J. Note on the cochromatic number of several surfaces. J. Graph Theory. 4:1980;115-117.
20. Wagner K. Monotonic coverings of finite sets. Elektron. Inform. Kybernet. 20:1984;633-639.