Covering Graphs by Colored Stable Sets

Electronic Notes in Discrete Mathematics

Volumn 17, Issue , 2004, Pages 145-149

  Faigle, Ulrich ^a   Fuchs, Bernhard ^a   Wienand, Britta ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247154045     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.03.029     Document Type: Article

References (4)

1. Frank A. On Chain and Antichain Families of a Partially Ordered Set. J. Combinatorial Theory Ser. B 29 (1980) 176-184
2. Földes S., and Hammer P.L. Split Graphs. In: Hoffmann F., et al. (Ed). Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing (1977), Lousiana State Univ., Baton Rouge, Louisiana 311-315
3. Lovász L., and Plummer M.D. Matching Theory. Annals of Discrete Mathematics 29 (1986) 224 North-Holland
4. Håstad J. Some optimal Inapproximability Results. Journal of ACM 48 (2001) 798-859