 | 2009 |
|---|
| 61 |       | Mostafa Blidia,
Frédéric Maffray,
Zoham Zemir:
On b-colorings in regular graphs.
Discrete Applied Mathematics 157(8): 1787-1793 (2009) |
| 60 | | Benjamin Lévêque,
Frédéric Maffray,
Bruce A. Reed,
Nicolas Trotignon:
Coloring Artemis graphs.
Theor. Comput. Sci. 410(21-23): 2234-2240 (2009) |
| 2008 |
|---|
| 59 | | Benjamin Lévêque,
Frédéric Maffray,
Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs
CoRR abs/0803.0956: (2008) |
| 58 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
Extremal perfect graphs for a bound on the domination number.
Discrete Mathematics 308(10): 1785-1791 (2008) |
| 57 | | Benjamin Lévêque,
Frédéric Maffray:
Coloring Bull-Free Perfectly Contractile Graphs.
SIAM J. Discrete Math. 21(4): 999-1018 (2008) |
| 56 | | Cláudia Linhares Sales,
Frédéric Maffray,
Bruce A. Reed:
On Planar Quasi-Parity Graphs.
SIAM J. Discrete Math. 22(1): 329-347 (2008) |
| 55 | | Frédéric Maffray,
Nicolas Trotignon,
Kristina Vuskovic:
Algorithms for Square-3PC(., .)-Free Berge Graphs.
SIAM J. Discrete Math. 22(1): 51-71 (2008) |
| 2007 |
|---|
| 54 | | Jenö Lehel,
Frédéric Maffray,
Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction
CoRR abs/0711.3958: (2007) |
| 53 | | Frédéric Maffray,
Meriem Mechebbek:
On b-perfect chordal graphs
CoRR abs/0711.3959: (2007) |
| 52 | | Frédéric Maffray,
Dieter Rautenbach:
Small step-dominating sets in trees.
Discrete Mathematics 307(9-10): 1212-1215 (2007) |
| 51 | | Benjamin Lévêque,
David Y. Lin,
Frédéric Maffray,
Nicolas Trotignon:
Detecting induced subgraphs.
Electronic Notes in Discrete Mathematics 29: 207-211 (2007) |
| 2006 |
|---|
| 50 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
Extremal graphs for a new upper bound on domination parameters in graphs.
Discrete Mathematics 306(19-20): 2314-2326 (2006) |
| 49 | | Celina M. Herrera de Figueiredo,
Chính T. Hoàng,
Frédéric Maffray:
A characterization of P4-comparability graphs.
Discrete Mathematics 306(19-20): 2461-2472 (2006) |
| 48 | | Frédéric Maffray,
Nicolas Trotignon:
A class of perfectly contractile graphs.
J. Comb. Theory, Ser. B 96(1): 1-19 (2006) |
| 2005 |
|---|
| 47 | | Benjamin Lévêque,
Frédéric Maffray,
Bruce A. Reed,
Nicolas Trotignon:
Coloring Artemis graphs
CoRR abs/cs/0504082: (2005) |
| 46 | | Vincent Jost,
Benjamin Lévêque,
Frédéric Maffray:
Precoloring co-Meyniel graphs
CoRR abs/cs/0509004: (2005) |
| 45 | | Kathie Cameron,
Jack Edmonds,
Benjamin Lévêque,
Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction
CoRR abs/cs/0509023: (2005) |
| 44 | | Mostafa Blidia,
Mustapha Chellali,
Frédéric Maffray:
On average lower independence and domination numbers in graphs.
Discrete Mathematics 295(1-3): 1-11 (2005) |
| 43 | | Benjamin Lévêque,
Frédéric Maffray:
Coloring Meyniel graphs in linear time.
Electronic Notes in Discrete Mathematics 22: 25-28 (2005) |
| 42 | | Frédéric Maffray,
Nicolas Trotignon,
Kristina Vuskovic:
Algorithms for 3PC(., .)-free Berge graphs.
Electronic Notes in Discrete Mathematics 22: 73-77 (2005) |
| 41 | | Frédéric Maffray,
Nicolas Trotignon:
Algorithms for Perfectly Contractile Graphs.
SIAM J. Discrete Math. 19(3): 553-574 (2005) |
| 2004 |
|---|
| 40 | | Benjamin Lévêque,
Frédéric Maffray:
Coloring Meyniel graphs in linear time
CoRR cs.DM/0405059: (2004) |
| 39 | | Chính T. Hoàng,
Stefan Hougardy,
Frédéric Maffray,
Nadimpalli V. R. Mahadev:
On simplicial and co-simplicial vertices in graphs.
Discrete Applied Mathematics 138(1-2): 117-132 (2004) |
| 38 | | 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) |
| 37 | | Sylvain Gravier,
Frédéric Maffray:
On the choice number of claw-free perfect graphs.
Discrete Mathematics 276(1-3): 211-218 (2004) |
| 36 | | 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) |
| 35 | | Celina M. Herrera de Figueiredo,
Frédéric Maffray:
Optimizing Bull-Free Perfect Graphs.
SIAM J. Discrete Math. 18(2): 226-240 (2004) |
| 34 | | Cláudia Linhares Sales,
Frédéric Maffray:
On dart-free perfectly contractile graphs.
Theor. Comput. Sci. 321(2-3): 171-194 (2004) |
| 2003 |
|---|
| 33 | | Sylvain Gravier,
Frédéric Maffray,
Bojan Mohar:
On a list-coloring problem.
Discrete Mathematics 268(1-3): 303-308 (2003) |
| 32 | | 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) |
| 2001 |
|---|
| 31 | | 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) |
| 30 | | Celina M. Herrera de Figueiredo,
Frédéric Maffray,
Oscar Porto:
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.
Graphs and Combinatorics 17(3): 435-456 (2001) |
| 29 | | Cláudia Linhares Sales,
Frédéric Maffray,
Bruce A. Reed:
Recognizing Planar Strict Quasi-Parity Graphs.
Graphs and Combinatorics 17(4): 745-757 (2001) |
| 2000 |
|---|
| 28 |  | Cláudia Linhares Sales,
Frédéric Maffray:
On Dart-Free Perfectly Contractile Graphs. Extended Abstract.
LATIN 2000: 135-144 |
| 1999 |
|---|
| 27 | | Jacques Carlier,
Alain Hertz,
Frédéric Maffray,
Marino Widmer:
Preface.
Discrete Applied Mathematics 94(1-3): 1 (1999) |
| 26 | | Frédéric Maffray,
Myriam Preissmann:
Sequential Colorings and Perfect Graphs.
Discrete Applied Mathematics 94(1-3): 287-296 (1999) |
| 25 | | Mostafa Blidia,
Pierre Duchet,
Henry Jacob,
Frédéric Maffray,
Henry Meyniel:
Some operations preserving the existence of kernels.
Discrete Mathematics 205(1-3): 211-216 (1999) |
| 24 | | Frédéric Maffray,
Bruce A. Reed:
A Description of Claw-Free Perfect Graphs.
J. Comb. Theory, Ser. B 75(1): 134-156 (1999) |
| 1998 |
|---|
| 23 | | 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) |
| 22 | | Cláudia Linhares Sales,
Frédéric Maffray:
Even Pairs in Claw-Free Perfect Graphs.
J. Comb. Theory, Ser. B 74(2): 169-191 (1998) |
| 1997 |
|---|
| 21 | | Hacène Aït Haddadène,
Frédéric Maffray:
Coloring perfect degenerate graphs.
Discrete Mathematics 163(1-3): 211-215 (1997) |
| 20 | | Hazel Everett,
Celina M. Herrera de Figueiredo,
Cláudia Linhares Sales,
Frédéric Maffray,
Oscar Porto,
Bruce A. Reed:
Path parity and perfection.
Discrete Mathematics 165-166: 233-252 (1997) |
| 19 | | Sylvain Gravier,
Frédéric Maffray:
Choice number of 3-colorable elementary graphs.
Discrete Mathematics 165-166: 353-358 (1997) |
| 1996 |
|---|
| 18 | | Jenö Lehel,
Frédéric Maffray,
Myriam Preissmann:
Graphs with Largest Number of Minimum Cuts.
Discrete Applied Mathematics 65(1-3): 387-407 (1996) |
| 17 | | Frédéric Maffray,
Myriam Preissmann:
On the NP-completeness of the k-colorability problem for triangle-free graphs.
Discrete Mathematics 162(1-3): 313-317 (1996) |
| 16 | | Chính T. Hoàng,
Stefan Hougardy,
Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs.
J. Comb. Theory, Ser. B 67(2): 212-237 (1996) |
| 1995 |
|---|
| 15 | | Frédéric Maffray,
Myriam Preissmann:
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
J. Comb. Theory, Ser. B 63(2): 294-309 (1995) |
| 1994 |
|---|
| 14 | | Elias Dahlhaus,
Peter L. Hammer,
Frédéric Maffray,
Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
WG 1994: 81-92 |
| 13 | | Frédéric Maffray,
Myriam Preissmann:
Linear Recognition of Pseudo-split Graphs.
Discrete Applied Mathematics 52(3): 307-312 (1994) |
| 1993 |
|---|
| 12 | | Peter L. Hammer,
Frédéric Maffray:
Preperfect graphs.
Combinatorica 13(2): 199-208 (1993) |
| 11 | | Mostafa Blidia,
Pierre Duchet,
Frédéric Maffray:
On kernels in perfect graphs.
Combinatorica 13(2): 231-233 (1993) |
| 10 | | Leizhen Cai,
Frédéric Maffray:
On the SPANNING k-Tree Problem.
Discrete Applied Mathematics 44(1-3): 139-156 (1993) |
| 9 | | Frédéric Maffray:
Antitwins in partitionable graphs.
Discrete Mathematics 112(1-3): 275-278 (1993) |
| 1992 |
|---|
| 8 | | Chính T. Hoàng,
Frédéric Maffray,
Stephan Olariu,
Myriam Preissmann:
A charming class of perfectly orderable graphs.
Discrete Mathematics 102(1): 67-74 (1992) |
| 7 | | Chính T. Hoàng,
Frédéric Maffray:
On slim graphs, even pairs, and star-cutsets.
Discrete Mathematics 105(1-3): 93-102 (1992) |
| 6 | | Frédéric Maffray:
Kernels in perfect line-graphs.
J. Comb. Theory, Ser. B 55(1): 1-8 (1992) |
| 1991 |
|---|
| 5 | | Peter L. Hammer,
Frédéric Maffray,
Maurice Queyranne:
Cut-threshold graphs.
Discrete Applied Mathematics 30(2-3): 163-179 (1991) |
| 4 | | Chính T. Hoàng,
Frédéric Maffray,
Myriam Preissmann:
New properties of perfectly orderable graphs and strongly perfect graphs.
Discrete Mathematics 98(3): 161-174 (1991) |
| 1990 |
|---|
| 3 | | Peter L. Hammer,
Frédéric Maffray:
Completely separable graphs.
Discrete Applied Mathematics 27(1-2): 85-99 (1990) |
| 1987 |
|---|
| 2 | | Frédéric Maffray,
Henry Meyniel:
On a relationship between Hadwiger and stability numbers.
Discrete Mathematics 64(1): 39-42 (1987) |
| 1986 |
|---|
| 1 | | Frédéric Maffray:
On kernels in i-triangulated graphs.
Discrete Mathematics 61(2-3): 247-251 (1986) |
