| |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 5 |       | Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. Combinatorics, Probability & Computing 7(4): 375-386 (1998) |
Selection of 1 from 8 records - Bernd Kreuter has 6 coauthors
Copyright © 2010-01-04 by Michael Ley (ley@uni-trier.de)