| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 3 |      | David Défossez: Complexity of clique-coloring odd-hole-free graphs. Journal of Graph Theory 62(2): 139-156 (2009) |
| 2008 | ||
| 2 | | David Défossez: A sufficient condition for the bicolorability of a hypergraph. Discrete Mathematics 308(11): 2265-2268 (2008) |
| 2006 | ||
| 1 | | David Défossez: Clique-coloring some classes of odd-hole-free graphs. Journal of Graph Theory 53(3): 233-249 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page