Frédéric Maffray

Frédéric Maffray, Ana Silva: b-colouring the Cartesian product of trees and some other graphs. Discrete Applied Mathematics 161(4-5): 650-669 (2013)

Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel: The chromatic number of {P₅, K₄}-free graphs. Discrete Mathematics 313(6): 743-754 (2013)

Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discrete Applied Mathematics 160(4-5): 471-478 (2012)

Simone Dantas, Frédéric Maffray, Ana Silva: 2k₂-partition of some classes of graphs. Discrete Applied Mathematics 160(18): 2662-2668 (2012)

T. Karthick, Frédéric Maffray: A characterization of claw-free b-perfect graphs. Discrete Mathematics 312(2): 324-330 (2012)

Frédéric Maffray, Ana Silva: b-colouring outerplanar graphs with large girth. Discrete Mathematics 312(10): 1796-1803 (2012)

Mustapha Chellali, Frédéric Maffray: Dominator Colorings in Some Classes of Graphs. Graphs and Combinatorics 28(1): 97-107 (2012)

Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon: On graphs with no induced subdivision of K₄. J. Comb. Theory, Ser. B 102(4): 924-947 (2012)

Victor Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray: New Bounds on the Grundy Number of Products of Graphs. Journal of Graph Theory 71(1): 78-88 (2012)

Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek: A Characterization of b-Perfect Graphs. Journal of Graph Theory 71(1): 95-122 (2012)

Frédéric Maffray, Grégory Morel: On 3-Colorable P₅-Free Graphs. SIAM J. Discrete Math. 26(4): 1682-1708 (2012)

Kathie Cameron, Benjamin Lévêque, Frédéric Maffray: Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428: 10-17 (2012)

Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray: The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Annals OR 188(1): 1-18 (2011)

Simone Dantas, Celina M. Herrera de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray: The chain graph sandwich problem. Annals OR 188(1): 133-139 (2011)

Martin Charles Golumbic, Frédéric Maffray, Grégory Morel: A characterization of chain probe graphs. Annals OR 188(1): 175-183 (2011)

Celina M. Herrera de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel: Transitive orientations in bull-reducible Berge graphs. Discrete Applied Mathematics 159(7): 561-573 (2011)

Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas: Connected domination dot-critical graphs. Contributions to Discrete Mathematics 5(2) (2010)

Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek: A characterization of b-perfect graphs. CoRR abs/1004.5306 (2010)

Mostafa Blidia, Frédéric Maffray, Zoham Zemir: On b-colorings in regular graphs. Discrete Applied Mathematics 157(8): 1787-1793 (2009)

Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer: Foreword. Discrete Applied Mathematics 157(17): 3495-3496 (2009)

Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray: On minimally b-imperfect graphs. Discrete Applied Mathematics 157(17): 3519-3530 (2009)

Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon: Detecting induced subgraphs. Discrete Applied Mathematics 157(17): 3540-3551 (2009)

Victor Campos, Cláudia Linhares Sales, Frédéric Maffray, Ana Silva: b-chromatic number of cacti. Electronic Notes in Discrete Mathematics 35: 281-286 (2009)

Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon: On the b-Coloring of Cographs and P₄-Sparse Graphs. Graphs and Combinatorics 25(2): 153-167 (2009)

Frédéric Maffray, Meriem Mechebbek: On b-perfect Chordal Graphs. Graphs and Combinatorics 25(3): 365-375 (2009)

Frédéric Maffray: Stable sets in k-colorable P₅-free graphs. Inf. Process. Lett. 109(23-24): 1235-1237 (2009)

Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Maximum directed cuts in digraphs with degree restriction. Journal of Graph Theory 61(2): 140-156 (2009)

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs. Journal of Graph Theory 62(4): 369-384 (2009)

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)

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)

Benjamin Lévêque, Frédéric Maffray: Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discrete Math. 21(4): 999-1018 (2008)

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic: Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discrete Math. 22(1): 51-71 (2008)

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)

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs. CoRR abs/0803.0956 (2008)

Frédéric Maffray, Dieter Rautenbach: Small step-dominating sets in trees. Discrete Mathematics 307(9-10): 1212-1215 (2007)

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)

Vincent Jost, Benjamin Lévêque, Frédéric Maffray: Precoloring Extension of Co-Meyniel Graphs. Graphs and Combinatorics 23(3): 291-301 (2007)

Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Maximum directed cuts in digraphs with degree restriction. CoRR abs/0711.3958 (2007)

Frédéric Maffray, Meriem Mechebbek: On b-perfect chordal graphs. CoRR abs/0711.3959 (2007)

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)

Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray: A characterization of P₄-comparability graphs. Discrete Mathematics 306(19-20): 2461-2472 (2006)

Frédéric Maffray, Nicolas Trotignon: A class of perfectly contractile graphs. J. Comb. Theory, Ser. B 96(1): 1-19 (2006)

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)

Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray: Exact double domination in graphs. Discussiones Mathematicae Graph Theory 25(3): 291-302 (2005)

Benjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time. Electronic Notes in Discrete Mathematics 22: 25-28 (2005)

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic: Algorithms for 3PC(., .)-free Berge graphs. Electronic Notes in Discrete Mathematics 22: 73-77 (2005)

Frédéric Maffray, Nicolas Trotignon: Algorithms for Perfectly Contractile Graphs. SIAM J. Discrete Math. 19(3): 553-574 (2005)

Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs. CoRR abs/cs/0504082 (2005)

Vincent Jost, Benjamin Lévêque, Frédéric Maffray: Precoloring co-Meyniel graphs. CoRR abs/cs/0509004 (2005)

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)

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)

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)

Sylvain Gravier, Frédéric Maffray: On the choice number of claw-free perfect graphs. Discrete Mathematics 276(1-3): 211-218 (2004)

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)

Celina M. Herrera de Figueiredo, Frédéric Maffray: Optimizing Bull-Free Perfect Graphs. SIAM J. Discrete Math. 18(2): 226-240 (2004)

Cláudia Linhares Sales, Frédéric Maffray: On dart-free perfectly contractile graphs. Theor. Comput. Sci. 321(2-3): 171-194 (2004)

Benjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time. CoRR cs.DM/0405059 (2004)

Sylvain Gravier, Frédéric Maffray, Bojan Mohar: On a list-coloring problem. Discrete Mathematics 268(1-3): 303-308 (2003)

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)

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)

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)

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)

Cláudia Linhares Sales, Frédéric Maffray: On Dart-Free Perfectly Contractile Graphs. Extended Abstract. LATIN 2000: 135-144

Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer: Preface. Discrete Applied Mathematics 94(1-3): 1 (1999)

Frédéric Maffray, Myriam Preissmann: Sequential Colorings and Perfect Graphs. Discrete Applied Mathematics 94(1-3): 287-296 (1999)

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)

Frédéric Maffray, Bruce A. Reed: A Description of Claw-Free Perfect Graphs. J. Comb. Theory, Ser. B 75(1): 134-156 (1999)

Chính T. Hoàng, Frédéric Maffray, Marc Noy: A characterization of P₄-indifference graphs. Journal of Graph Theory 31(3): 155-162 (1999)

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)

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)

Sylvain Gravier, Frédéric Maffray: Graphs whose choice number is equal to their chromatic number. Journal of Graph Theory 27(2): 87-97 (1998)

Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann: On minimal imperfect graphs with circular symmetry. Journal of Graph Theory 29(4): 209-225 (1998)

Hacène Aït Haddadène, Frédéric Maffray: Coloring perfect degenerate graphs. Discrete Mathematics 163(1-3): 211-215 (1997)

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)

Sylvain Gravier, Frédéric Maffray: Choice number of 3-colorable elementary graphs. Discrete Mathematics 165-166: 353-358 (1997)

Celina M. Herrera de Figueiredo, Frédéric Maffray, Oscar Porto: On the structure of bull-free perfect graphs. Graphs and Combinatorics 13(1): 31-55 (1997)

Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Graphs with Largest Number of Minimum Cuts. Discrete Applied Mathematics 65(1-3): 387-407 (1996)

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)

Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray: On the P₄-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory, Ser. B 67(2): 212-237 (1996)

András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray: Minimal non-neighborhood-perfect graphs. Journal of Graph Theory 21(1): 55-66 (1996)

Frédéric Maffray, Oscar Porto, Myriam Preissmann: A generalization of simplicial elimination orderings. Journal of Graph Theory 23(2): 203-208 (1996)

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)

Frédéric Maffray, Myriam Preissmann: Linear Recognition of Pseudo-split Graphs. Discrete Applied Mathematics 52(3): 307-312 (1994)

Frédéric Maffray, Myriam Preissmann: Perfect graphs with no P ₅ and no K ₅. Graphs and Combinatorics 10(2-4): 179-184 (1994)

Mostafa Blidia, Pierre Duchet, Frédéric Maffray: On the orientation of meyniel graphs. Journal of Graph Theory 18(7): 705-711 (1994)

Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu: On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG 1994: 81-92

Peter L. Hammer, Frédéric Maffray: Preperfect graphs. Combinatorica 13(2): 199-208 (1993)

Mostafa Blidia, Pierre Duchet, Frédéric Maffray: On kernels in perfect graphs. Combinatorica 13(2): 231-233 (1993)

Leizhen Cai, Frédéric Maffray: On the SPANNING k-Tree Problem. Discrete Applied Mathematics 44(1-3): 139-156 (1993)

Frédéric Maffray: Antitwins in partitionable graphs. Discrete Mathematics 112(1-3): 275-278 (1993)

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)

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)

Frédéric Maffray: Kernels in perfect line-graphs. J. Comb. Theory, Ser. B 55(1): 1-8 (1992)

Peter L. Hammer, Frédéric Maffray, Maurice Queyranne: Cut-threshold graphs. Discrete Applied Mathematics 30(2-3): 163-179 (1991)

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)

Peter L. Hammer, Frédéric Maffray: Completely separable graphs. Discrete Applied Mathematics 27(1-2): 85-99 (1990)

Ryan Hayward, Chính T. Hoàng, Frédéric Maffray: Optimizing weakly triangulated graphs. Graphs and Combinatorics 6(1): 33-35 (1990)

Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray: More characterizations of triangulated graphs. Journal of Graph Theory 14(4): 413-422 (1990)

Chính T. Hoàng, Frédéric Maffray: Opposition graphs are strict quasi-parity graphs. Graphs and Combinatorics 5(1): 83-85 (1989)

Ryan Hayward, Chính T. Hoàng, Frédéric Maffray: Optimizing weakly triangulated graphs. Graphs and Combinatorics 5(1): 339-349 (1989)

Frédéric Maffray, Henry Meyniel: On a relationship between Hadwiger and stability numbers. Discrete Mathematics 64(1): 39-42 (1987)

Frédéric Maffray: On kernels in i-triangulated graphs. Discrete Mathematics 61(2-3): 247-251 (1986)