Frédéric Maffray

According to our database, Frédéric Maffray authored at least 138 papers between 1986 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.

Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray

Ann. Oper. Res., June, 2024

2021

Coloring rings.

Frédéric Maffray, Irena Penev, Kristina Vuskovic

J. Graph Theory, 2021

2020

Coloring graphs with no induced five-vertex path or gem.

Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray

J. Graph Theory, 2020

2019

Square-Free Graphs with No Six-Vertex Induced Path.

T. Karthick, Frédéric Maffray

SIAM J. Discret. Math., 2019

Coloring square-free Berge graphs.

Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

J. Comb. Theory B, 2019

Polynomial Cases for the Vertex Coloring Problem.

T. Karthick, Frédéric Maffray, Lucas Pastor

Algorithmica, 2019

2018

Coloring (gem, co-gem)-free graphs.

T. Karthick, Frédéric Maffray

J. Graph Theory, 2018

χ-bounded families of oriented graphs.

Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora

J. Graph Theory, 2018

Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].

Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl

J. Comb. Theory B, 2018

Even pairs and prism corners in square-free Berge graphs.

Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl

J. Comb. Theory B, 2018

On some graphs with a unique perfect matching.

Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach

Inf. Process. Lett., 2018

Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs.

Frédéric Maffray, Lucas Pastor

Discret. Math., 2018

Decomposition techniques applied to the Clique-Stable set separation problem.

Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor

Discret. Math., 2018

A coloring algorithm for -free line graphs.

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray

Discret. Appl. Math., 2018

2017

Graphs with No Induced Five-Vertex Path or Antipath.

Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev

J. Graph Theory, 2017

Long induced paths in graphs.

Louis Esperet, Laetitia Lemoine, Frédéric Maffray

Eur. J. Comb., 2017

4-coloring (P6, bull)-free graphs.

Frédéric Maffray, Lucas Pastor

Discret. Appl. Math., 2017

Maximum weight independent sets in classes related to claw-free graphs.

T. Karthick, Frédéric Maffray

Discret. Appl. Math., 2017

On color-critical (P₅, co-P₅)-free graphs.

Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait

Discret. Appl. Math., 2017

Coloring ($P_5$, bull)-free graphs.

Frédéric Maffray

CoRR, 2017

Small Feedback Vertex Sets in Planar Digraphs.

Louis Esperet, Laetitia Lemoine, Frédéric Maffray

Electron. J. Comb., 2017

2016

Vizing Bound for the Chromatic Number on Some Graph Classes.

T. Karthick, Frédéric Maffray

Graphs Comb., 2016

On the Choosability of Claw-Free Perfect Graphs.

Sylvain Gravier, Frédéric Maffray, Lucas Pastor

Graphs Comb., 2016

Weighted independent sets in classes of P₆-free graphs.

T. Karthick, Frédéric Maffray

Discret. Appl. Math., 2016

Maximum Weight Stable Set in ($P_7$, bull)-free graphs.

Frédéric Maffray, Lucas Pastor

CoRR, 2016

The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs.

Frédéric Maffray, Lucas Pastor

CoRR, 2016

The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs.

Frédéric Maffray, Lucas Pastor

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.

T. Karthick, Frédéric Maffray

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Even pairs in square-free Berge graphs.

Frédéric Maffray

Electron. Notes Discret. Math., 2015

Equitable partition of graphs into induced forests.

Louis Esperet, Laetitia Lemoine, Frédéric Maffray

Discret. Math., 2015

Domination, coloring and stability in P5-reducible graphs.

Jean-Luc Fouquet, Frédéric Maffray

Discret. Appl. Math., 2015

On edge-b-critical graphs.

Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray

Discret. Appl. Math., 2015

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.

Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira

Discret. Appl. Math., 2015

Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds.

Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray

Discret. Appl. Math., 2015

Graphs with no induced wheel or antiwheel.

Frédéric Maffray

CoRR, 2015

2014

Fast recognition of doubled graphs.

Frédéric Maffray

Theor. Comput. Sci., 2014

List-Coloring Claw-Free Graphs with Small Clique Number.

Louis Esperet, András Gyárfás, Frédéric Maffray

Graphs Comb., 2014

2013

Fire Containment in Planar Graphs.

Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma

J. Graph Theory, 2013

The chromatic number of {<i>P</i>₅, <i>K</i>₄}-free graphs.

Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel

Discret. Math., 2013

b-colouring the Cartesian product of trees and some other graphs.

Frédéric Maffray, Ana Silva

Discret. Appl. Math., 2013

Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

CoRR, 2013

ERRATUM to: Double domination edge removal critical graphs.

Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Australas. J Comb., 2013

2012

Coloring vertices of a graph or finding a Meyniel obstruction.

Kathie Cameron, Benjamin Lévêque, Frédéric Maffray

Theor. Comput. Sci., 2012

On 3-Colorable P₅-Free Graphs.

Frédéric Maffray, Grégory Morel

SIAM J. Discret. Math., 2012

A Characterization of b-Perfect Graphs.

Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek

J. Graph Theory, 2012

New Bounds on the Grundy Number of Products of Graphs.

Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray

J. Graph Theory, 2012

On graphs with no induced subdivision of K₄.

Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon

J. Comb. Theory B, 2012

Dominator Colorings in Some Classes of Graphs.

Mustapha Chellali, Frédéric Maffray

Graphs Comb., 2012

b-colouring outerplanar graphs with large girth.

Frédéric Maffray, Ana Silva

Discret. Math., 2012

A characterization of claw-free b-perfect graphs.

T. Karthick, Frédéric Maffray

Discret. Math., 2012

2k₂-partition of some classes of graphs.

Simone Dantas, Frédéric Maffray, Ana Silva

Discret. Appl. Math., 2012

Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences.

Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray

Discret. Appl. Math., 2012

b-coloring of some bipartite graphs.

Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray

Australas. J Comb., 2012

2011

Transitive orientations in bull-reducible Berge graphs.

Celina M. H. de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel

Discret. Appl. Math., 2011

A characterization of chain probe graphs.

Martin Charles Golumbic, Frédéric Maffray, Grégory Morel

Ann. Oper. Res., 2011

The chain graph sandwich problem.

Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray

Ann. Oper. Res., 2011

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.

Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray

Ann. Oper. Res., 2011

2010

Connected domination dot-critical graphs.

Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas

Contributions Discret. Math., 2010

Double domination edge removal critical graphs.

Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Australas. J Comb., 2010

2009

Coloring Artemis graphs.

Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon

Theor. Comput. Sci., 2009

Characterizing path graphs by forbidden induced subgraphs.

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann

J. Graph Theory, 2009

Maximum directed cuts in digraphs with degree restriction.

Jenö Lehel, Frédéric Maffray, Myriam Preissmann

J. Graph Theory, 2009

Stable sets in k-colorable P₅-free graphs.

Frédéric Maffray

Inf. Process. Lett., 2009

On b-perfect Chordal Graphs.

Frédéric Maffray, Meriem Mechebbek

Graphs Comb., 2009

On the b-Coloring of Cographs and <i>P</i>₄-Sparse Graphs.

Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon

Graphs Comb., 2009

b-chromatic number of cacti.

Victor A. Campos, Cláudia Linhares Sales, Frédéric Maffray, Ana Silva

Electron. Notes Discret. Math., 2009

On minimally b-imperfect graphs.

Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray

Discret. Appl. Math., 2009

Foreword.

Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer

Discret. Appl. Math., 2009

On b-colorings in regular graphs.

Mostafa Blidia, Frédéric Maffray, Zoham Zemir

Discret. Appl. Math., 2009

2008

On Planar Quasi-Parity Graphs.

Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed

SIAM J. Discret. Math., 2008

Algorithms for Square-3PC(., .)-Free Berge Graphs.

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

SIAM J. Discret. Math., 2008

Coloring Bull-Free Perfectly Contractile Graphs.

Benjamin Lévêque, Frédéric Maffray

SIAM J. Discret. Math., 2008

Extremal perfect graphs for a bound on the domination number.

Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Discret. Math., 2008

2007

Precoloring Extension of Co-Meyniel Graphs.

Vincent Jost, Benjamin Lévêque, Frédéric Maffray

Graphs Comb., 2007

Detecting induced subgraphs.

Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon

Electron. Notes Discret. Math., 2007

Small step-dominating sets in trees.

Frédéric Maffray, Dieter Rautenbach

Discret. Math., 2007

Locating-domination and identifying codes in trees.

Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri

Australas. J Comb., 2007

2006

A class of perfectly contractile graphs.

Frédéric Maffray, Nicolas Trotignon

J. Comb. Theory B, 2006

A characterization of P₄-comparability graphs.

Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray

Discret. Math., 2006

Extremal graphs for a new upper bound on domination parameters in graphs.

Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Discret. Math., 2006

2005

Algorithms for Perfectly Contractile Graphs.

Frédéric Maffray, Nicolas Trotignon

SIAM J. Discret. Math., 2005

Algorithms for 3PC(., .)-free Berge graphs.

Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

Electron. Notes Discret. Math., 2005

Coloring Meyniel graphs in linear time.

Benjamin Lévêque, Frédéric Maffray

Electron. Notes Discret. Math., 2005

Exact double domination in graphs.

Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray

Discuss. Math. Graph Theory, 2005

On average lower independence and domination numbers in graphs.

Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction

Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray

CoRR, 2005

Precoloring co-Meyniel graphs

Vincent Jost, Benjamin Lévêque, Frédéric Maffray

CoRR, 2005

2004

On dart-free perfectly contractile graphs.

Cláudia Linhares Sales, Frédéric Maffray

Theor. Comput. Sci., 2004

Optimizing Bull-Free Perfect Graphs.

Celina M. H. de Figueiredo, Frédéric Maffray

SIAM J. Discret. Math., 2004

Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.

Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon

Eur. J. Comb., 2004

On the choice number of claw-free perfect graphs.

Sylvain Gravier, Frédéric Maffray

Discret. Math., 2004

On simplicial and co-simplicial vertices in graphs.

Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev

Discret. Appl. Math., 2004

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

Simone Dantas, Sylvain Gravier, Frédéric Maffray

Discret. Appl. Math., 2004

2003

On a list-coloring problem.

Sylvain Gravier, Frédéric Maffray, Bojan Mohar

Discret. Math., 2003

Coloring the hypergraph of maximal cliques of a graph with no long path.

Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray

Discret. Math., 2003

2001

Recognizing Planar Strict Quasi-Parity Graphs.

Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed

Graphs Comb., 2001

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.

Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto

Graphs Comb., 2001

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar

Electron. Notes Discret. Math., 2001

2000

On Dart-Free Perfectly Contractile Graphs. Extended Abstract.

Cláudia Linhares Sales, Frédéric Maffray

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

A characterization of <i>P</i>₄-indifference graphs.

Chính T. Hoàng, Frédéric Maffray, Marc Noy

J. Graph Theory, 1999

A Description of Claw-Free Perfect Graphs.

Frédéric Maffray, Bruce A. Reed

J. Comb. Theory B, 1999

Some operations preserving the existence of kernels.

Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel

Discret. Math., 1999

Sequential Colorings and Perfect Graphs.

Frédéric Maffray, Myriam Preissmann

Discret. Appl. Math., 1999

Preface.

Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer

Discret. Appl. Math., 1999

1998

Graphs whose choice number is equal to their chromatic number.

Sylvain Gravier, Frédéric Maffray

J. Graph Theory, 1998

On minimal imperfect graphs with circular symmetry.

Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann

J. Graph Theory, 1998

Even Pairs in Claw-Free Perfect Graphs.

Cláudia Linhares Sales, Frédéric Maffray

J. Comb. Theory B, 1998

An algorithm for coloring some perfect graphs.

Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray

Discret. Math., 1998

1997

On Planar Perfectly Contractile Graphs.

Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed

Graphs Comb., 1997

On the structure of bull-free perfect graphs.

Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto

Graphs Comb., 1997

Coloring perfect degenerate graphs.

Hacène Aït Haddadène, Frédéric Maffray

Discret. Math., 1997

Choice number of 3-colorable elementary graphs.

Sylvain Gravier, Frédéric Maffray

Discret. Math., 1997

Path parity and perfection.

Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed

Discret. Math., 1997

1996

A generalization of simplicial elimination orderings.

Frédéric Maffray, Oscar Porto, Myriam Preissmann

J. Graph Theory, 1996

Minimal non-neighborhood-perfect graphs.

András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray

J. Graph Theory, 1996

On the <i>P</i>₄-Structure of Perfect Graphs V. Overlap Graphs.

Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray

J. Comb. Theory B, 1996

On the NP-completeness of the k-colorability problem for triangle-free graphs.

Frédéric Maffray, Myriam Preissmann

Discret. Math., 1996

Graphs with Largest Number of Minimum Cuts.

Jenö Lehel, Frédéric Maffray, Myriam Preissmann

Discret. Appl. Math., 1996

1995

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.

Frédéric Maffray, Myriam Preissmann

J. Comb. Theory B, 1995

1994

On the orientation of meyniel graphs.

Mostafa Blidia, Pierre Duchet, Frédéric Maffray

J. Graph Theory, 1994

Perfect graphs with no <i>P</i> ₅ and no <i>K</i> ₅.

Frédéric Maffray, Myriam Preissmann

Graphs Comb., 1994

Linear Recognition of Pseudo-split Graphs.

Frédéric Maffray, Myriam Preissmann

Discret. Appl. Math., 1994

On Domination Elimination Orderings and Domination Graphs (Extended Abstract).

Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

Antitwins in partitionable graphs.

Frédéric Maffray

Discret. Math., 1993

On the SPANNING <i>k</i>-Tree Problem.

Leizhen Cai, Frédéric Maffray

Discret. Appl. Math., 1993

Preperfect graphs.

Peter L. Hammer, Frédéric Maffray

Comb., 1993

On kernels in perfect graphs.

Mostafa Blidia, Pierre Duchet, Frédéric Maffray

Comb., 1993

1992

Kernels in perfect line-graphs.

Frédéric Maffray

J. Comb. Theory B, 1992

A charming class of perfectly orderable graphs.

Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann

Discret. Math., 1992

On slim graphs, even pairs, and star-cutsets.

Chính T. Hoàng, Frédéric Maffray

Discret. Math., 1992

1991

New properties of perfectly orderable graphs and strongly perfect graphs.

Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann

Discret. Math., 1991

Cut-threshold graphs.

Peter L. Hammer, Frédéric Maffray, Maurice Queyranne

Discret. Appl. Math., 1991

1990

More characterizations of triangulated graphs.

Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray

J. Graph Theory, 1990

Optimizing weakly triangulated graphs.

Ryan Hayward, Chính T. Hoàng, Frédéric Maffray

Graphs Comb., 1990

Completely separable graphs.

Peter L. Hammer, Frédéric Maffray

Discret. Appl. Math., 1990

1989

Opposition graphs are strict quasi-parity graphs.

Chính T. Hoàng, Frédéric Maffray

Graphs Comb., 1989

1987

On a relationship between Hadwiger and stability numbers.

Frédéric Maffray, Henry Meyniel

Discret. Math., 1987

1986

On kernels in i-triangulated graphs.

Frédéric Maffray

Discret. Math., 1986