Frédéric Maffray

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 41

Top Venues

Publications

Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. Ann. Oper. Res. 337 (2) (2024)
Frédéric Maffray, Irena Penev, Kristina Vuskovic
Coloring rings. J. Graph Theory 96 (4) (2021)
Maria Chudnovsky, Karthick Thiyagarajan, Peter Maceli, Frédéric Maffray
Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95 (4) (2020)
Karthick Thiyagarajan, Frédéric Maffray
Square-Free Graphs with No Six-Vertex Induced Path. SIAM J. Discret. Math. 33 (2) (2019)
Karthick Thiyagarajan, Frédéric Maffray, Lucas Pastor
Polynomial Cases for the Vertex Coloring Problem. Algorithmica 81 (3) (2019)
Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Coloring square-free Berge graphs. J. Comb. Theory, Ser. B 135 (2019)
Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory, Ser. B 131 (2018)
Karthick Thiyagarajan, Frédéric Maffray
Coloring (gem, co-gem)-free graphs. J. Graph Theory 89 (3) (2018)
Frédéric Maffray, Lucas Pastor
Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs. Discret. Math. 341 (5) (2018)
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray
A coloring algorithm for -free line graphs. Discret. Appl. Math. 234 (2018)
Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. J. Comb. Theory, Ser. B 133 (2018)
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341 (5) (2018)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some graphs with a unique perfect matching. Inf. Process. Lett. 139 (2018)
Maria Chudnovsky, Karthick Thiyagarajan, Peter Maceli, Frédéric Maffray
Coloring graphs with no induced five-vertex path or gem. CoRR (2018)
Karthick Thiyagarajan, Frédéric Maffray
Square-free graphs with no six-vertex induced path. CoRR (2018)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
χ-bounded families of oriented graphs. J. Graph Theory 89 (3) (2018)
Frédéric Maffray
Coloring ($P_5$, bull)-free graphs. CoRR (2017)
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
Graphs with No Induced Five-Vertex Path or Antipath. J. Graph Theory 84 (3) (2017)
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
Decomposition techniques applied to the Clique-Stable set Separation problem. CoRR (2017)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some Graphs with a Unique Perfect Matching. CoRR (2017)
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
)-free graphs. Discret. Appl. Math. 216 (2017)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Long induced paths in graphs. Eur. J. Comb. 62 (2017)
Karthick Thiyagarajan, Frédéric Maffray
Maximum weight independent sets in classes related to claw-free graphs. Discret. Appl. Math. 216 (2017)
Frédéric Maffray, Lucas Pastor
4-coloring (P6, bull)-free graphs. Discret. Appl. Math. 231 (2017)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Small Feedback Vertex Sets in Planar Digraphs. Electron. J. Comb. 24 (2) (2017)
Karthick Thiyagarajan, Frédéric Maffray, Lucas Pastor
Polynomial Cases for the Vertex Coloring Problem. CoRR (2017)
Karthick Thiyagarajan, Frédéric Maffray
-free graphs. Discret. Appl. Math. 209 (2016)
Sylvain Gravier, Frédéric Maffray, Lucas Pastor
On the Choosability of Claw-Free Perfect Graphs. Graphs Comb. 32 (6) (2016)
Karthick Thiyagarajan, Frédéric Maffray
Vizing Bound for the Chromatic Number on Some Graph Classes. Graphs Comb. 32 (4) (2016)
Frédéric Maffray, Lucas Pastor
Maximum Weight Stable Set in ($P_7$, bull)-free graphs. CoRR (2016)
Frédéric Maffray, Lucas Pastor
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. WG (2016)
Karthick Thiyagarajan, Frédéric Maffray
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. COCOON (2016)
Frédéric Maffray, Lucas Pastor
The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs. CoRR (2016)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
$χ$-bounded families of oriented graphs. CoRR (2016)
Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. 184 (2015)
Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. Discret. Appl. Math. 182 (2015)
Frédéric Maffray
Even pairs in square-free Berge graphs. Electron. Notes Discret. Math. 49 (2015)
Frédéric Maffray
Graphs with no induced wheel or antiwheel. CoRR (2015)
Jean-Luc Fouquet, Frédéric Maffray
Domination, coloring and stability in P5-reducible graphs. Discret. Appl. Math. 184 (2015)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Equitable partition of graphs into induced forests. Discret. Math. 338 (8) (2015)
Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray
On edge-b-critical graphs. Discret. Appl. Math. 180 (2015)
Louis Esperet, András Gyárfás, Frédéric Maffray
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs Comb. 30 (2) (2014)
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
Graphs with no induced five-vertex path or antipath. CoRR (2014)
Frédéric Maffray
Fast recognition of doubled graphs. Theor. Comput. Sci. 516 (2014)
Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma
Fire Containment in Planar Graphs. J. Graph Theory 73 (3) (2013)
Frédéric Maffray, Nicolas Trotignon
Algorithms for perfectly contractile graphs. CoRR (2013)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. CoRR (2013)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel
}-free graphs. Discret. Math. 313 (6) (2013)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs. CoRR (2013)
Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
ERRATUM to: Double domination edge removal critical graphs. Australas. J Comb. 55 (2013)
Frédéric Maffray, Ana Silva
b-colouring the Cartesian product of trees and some other graphs. Discret. Appl. Math. 161 (4-5) (2013)
Kathie Cameron, Benjamin Lévêque, Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428 (2012)
Mustapha Chellali, Frédéric Maffray
Dominator Colorings in Some Classes of Graphs. Graphs Comb. 28 (1) (2012)
Karthick Thiyagarajan, Frédéric Maffray
A characterization of claw-free b-perfect graphs. Discret. Math. 312 (2) (2012)
Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon
. J. Comb. Theory, Ser. B 102 (4) (2012)
Simone Dantas, Frédéric Maffray, Ana Silva
-partition of some classes of graphs. Discret. Appl. Math. 160 (18) (2012)
Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray
b-coloring of some bipartite graphs. Australas. J Comb. 53 (2012)
Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discret. Appl. Math. 160 (4-5) (2012)
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
A Characterization of b-Perfect Graphs. J. Graph Theory 71 (1) (2012)
Frédéric Maffray, Grégory Morel
-Free Graphs. SIAM J. Discret. Math. 26 (4) (2012)
Frédéric Maffray, Ana Silva
b-colouring outerplanar graphs with large girth. Discret. Math. 312 (10) (2012)
Victor A. 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. J. Graph Theory 71 (1) (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. Ann. Oper. Res. 188 (1) (2011)
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
The chain graph sandwich problem. Ann. Oper. Res. 188 (1) (2011)
Martin Charles Golumbic, Frédéric Maffray, Grégory Morel
A characterization of chain probe graphs. Ann. Oper. Res. 188 (1) (2011)
Celina M. H. de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel
Transitive orientations in bull-reducible Berge graphs. Discret. Appl. Math. 159 (7) (2011)
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
A characterization of b-perfect graphs CoRR (2010)
Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas
Connected domination dot-critical graphs. Contributions Discret. Math. 5 (2) (2010)
Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
Double domination edge removal critical graphs. Australas. J Comb. 48 (2010)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. Discret. Appl. Math. 157 (17) (2009)
Frédéric Maffray, Meriem Mechebbek
On b-perfect Chordal Graphs. Graphs Comb. 25 (3) (2009)
Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
Foreword. Discret. Appl. Math. 157 (17) (2009)
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction. J. Graph Theory 61 (2) (2009)
Victor A. Campos, Cláudia Linhares Sales, Frédéric Maffray, Ana Silva
b-chromatic number of cacti. Electron. Notes Discret. Math. 35 (2009)
Mostafa Blidia, Frédéric Maffray, Zoham Zemir
On b-colorings in regular graphs. Discret. Appl. Math. 157 (8) (2009)
Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon
-Sparse Graphs. Graphs Comb. 25 (2) (2009)
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory 62 (4) (2009)
Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray
On minimally b-imperfect graphs. Discret. Appl. Math. 157 (17) (2009)
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
Coloring Artemis graphs. Theor. Comput. Sci. 410 (21-23) (2009)
Frédéric Maffray
-free graphs. Inf. Process. Lett. 109 (23-24) (2009)
Benjamin Lévêque, Frédéric Maffray
Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discret. Math. 21 (4) (2008)
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
Characterizing path graphs by forbidden induced subgraphs CoRR (2008)
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
Extremal perfect graphs for a bound on the domination number. Discret. Math. 308 (10) (2008)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Frédéric Maffray, Meriem Mechebbek
On b-perfect chordal graphs CoRR (2007)
Frédéric Maffray, Dieter Rautenbach
Small step-dominating sets in trees. Discret. Math. 307 (9-10) (2007)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. Electron. Notes Discret. Math. 29 (2007)
Vincent Jost, Benjamin Lévêque, Frédéric Maffray
Precoloring Extension of Co-Meyniel Graphs. Graphs Comb. 23 (3) (2007)
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction CoRR (2007)
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri
Locating-domination and identifying codes in trees. Australas. J Comb. 39 (2007)
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
Extremal graphs for a new upper bound on domination parameters in graphs. Discret. Math. 306 (19-20) (2006)
Frédéric Maffray, Nicolas Trotignon
A class of perfectly contractile graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray
-comparability graphs. Discret. Math. 306 (19-20) (2006)
Kathie Cameron, Jack R. Edmonds, Benjamin Lévêque, Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction CoRR (2005)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for 3PC(., .)-free Berge graphs. Electron. Notes Discret. Math. 22 (2005)
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
On average lower independence and domination numbers in graphs. Discret. Math. 295 (1-3) (2005)
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
Coloring Artemis graphs CoRR (2005)
Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray
Exact double domination in graphs. Discuss. Math. Graph Theory 25 (3) (2005)
Frédéric Maffray, Nicolas Trotignon
Algorithms for Perfectly Contractile Graphs. SIAM J. Discret. Math. 19 (3) (2005)

Frédéric Maffray.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frédéric Maffray