![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 7 | Mihalis Yannakakis, Fanica Gavril: The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24(2): 133-137 (1987) |
Selection of 1 from 20 records - Fanica Gavril has 9 coauthors
Copyright © 2009-12-07 by Michael Ley (ley@uni-trier.de)