| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 43 |       | Simone Dantas, Sylvain Gravier, Frédéric Maffray: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Discrete Applied Mathematics 141(1-3): 93-101 (2004) |
| 42 | | Sylvain Gravier, Frédéric Maffray: On the choice number of claw-free perfect graphs. Discrete Mathematics 276(1-3): 211-218 (2004) |
| 41 | | Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon: Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets. Eur. J. Comb. 25(5): 719-734 (2004) |
| 38 | | Sylvain Gravier, Frédéric Maffray, Bojan Mohar: On a list-coloring problem. Discrete Mathematics 268(1-3): 303-308 (2003) |
| 37 | | Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray: Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Mathematics 272(2-3): 285-290 (2003) |
| 36 | | Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electronic Notes in Discrete Mathematics 7: 22-25 (2001) |
| 28 | | Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray: An algorithm for coloring some perfect graphs. Discrete Mathematics 183(1-3): 1-16 (1998) |
| 24 | | Sylvain Gravier, Frédéric Maffray: Choice number of 3-colorable elementary graphs. Discrete Mathematics 165-166: 353-358 (1997) |
Selection of 8 from 87 records - Frédéric Maffray has 58 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page