Get started
Author

Frédéric Maffray

Observed names: F Maffray, F. Maffray, Frédéric Maffray, Frederic Maffray, Fre´de´ric Maffray, Fr�d�ric Maffray, MAFFRAY, Frédéric, Maffray, Frederic, Maffray, Frédéric
Observed institutions: Rutgers, The State University of New Jersey, Institut polytechnique de Grenoble, Universidade Federal do Rio de Janeiro, Centre National de la Recherche Scientifique, Université Joseph Fourier, University of Toronto, Princeton University, Laboratoire des Sciences pour la Conception, l'Optimisation et la Production, Centre d'Analyse et de Mathématique Sociales, Translational Innovation in Medicine and Complexity, Université Pierre-et-Marie-Curie, Pôle de recherche et d'enseignement supérieur Université de Grenoble, Université Grenoble Alpes
ORCID: 0000-0002-8265-0415
Observed ORCID: 0000-0002-8265-0415
OpenAlex ID: A5064579274
Completely separable graphs
1990 · Peter L. Hammer, Frédéric Maffray · Discrete Applied Mathematics · 175
On the NP-completeness of the k-colorability problem for triangle-free graphs
1996 · Frédéric Maffray, Myriam Preissmann · Discrete Mathematics · 130
PDF
Optimizing weakly triangulated graphs
1990 · Ryan Hayward, Chính T. Hoàng, et al. · Graphs and Combinatorics · 98
PDF
Optimizing weakly triangulated graphs
1989 · Ryan Hayward, Chính Hoàng, et al. · Graphs and Combinatorics · 88
Coloring the hypergraph of maximal cliques of a graph with no long path
2003 · Sylvain Gravier, Chı́nh T. Hoàng, et al. · Discrete Mathematics · 74
Kernels in perfect line-graphs
1992 · Frédéric Maffray · Journal of Combinatorial Theory Series B · 72
PDF
Dominator Colorings in Some Classes of Graphs
2011 · Mustapha Chellali, Frédéric Maffray · Graphs and Combinatorics · 66
On the b-Coloring of Cographs and P 4-Sparse Graphs
2009 · Flavia Bonomo, Guillermo Durán, et al. · Graphs and Combinatorics · 59
Locating-domination and identifying codes in trees
2007 · Blidia, Mostafa, Chellali, Mustapha, et al. · HAL · 54
Detecting induced subgraphs
2009 · Benjamin Lévêque, David Y. Lin, et al. · Discrete Applied Mathematics · 52
PDF
A Description of Claw-Free Perfect Graphs
1999 · Frédéric Maffray, Bruce A. Reed · Journal of Combinatorial Theory Series B · 49
On graphs with no induced subdivision of K4
2012 · Benjamin Lévêque, Frédéric Maffray, et al. · Journal of Combinatorial Theory Series B · 48
PDF
Linear recognition of pseudo-split graphs
1994 · Frédéric Maffray, Myriam Preissmann · Discrete Applied Mathematics · 46
Algorithms for Perfectly Contractile Graphs
2005 · Frédéric Maffray, Nicolas Trotignon · SIAM Journal on Discrete Mathematics · 43
PDF
On b -colorings in regular graphs
2009 · Mostafa Blidia, Frédéric Maffray, et al. · Discrete Applied Mathematics · 39
On $3$-Colorable $P_5$-Free Graphs
2012 · Frédéric Maffray, Grégory Morel · SIAM Journal on Discrete Mathematics · 37
Graphs whose choice number is equal to their chromatic number
1998 · Sylvain Gravier, Fr�d�ric Maffray · Journal of Graph Theory · 35
The chromatic number of {P5,K4} -free graphs
2013 · Louis Esperet, Laetitia Lemoine, et al. · Discrete Mathematics · 33
PDF
On the structure of bull-free perfect graphs
1997 · Celina M. H. de Figueiredo, Frédéric Maffray, et al. · Graphs and Combinatorics · 30
On the SPANNING k-TREE problem
1993 · Leizhen Cai, Frédéric Maffray · Discrete Applied Mathematics · 29
PDF
Polynomial Cases for the Vertex Coloring Problem
2018 · T. Karthick, Frédéric Maffray, et al. · Algorithmica · 27
PDF
Square-Free Graphs with No Six-Vertex Induced Path
2019 · T. Karthick, Frédéric Maffray · SIAM Journal on Discrete Mathematics · 26
PDF
Coloring graphs with no induced five‐vertex path or gem
2020 · Maria Chudnovsky, T. Karthick, et al. · Journal of Graph Theory · 25
PDF
On color-critical ( P5 ,co- P5 )-free graphs
2016 · Harjinder S. Dhaliwal, Angèle M. Hamel, et al. · Discrete Applied Mathematics · 25
Optimizing Bull-Free Perfect Graphs
2004 · Celina M. H. de Figueiredo, Frédéric Maffray · SIAM Journal on Discrete Mathematics · 25
Works count: 186
Citation count: 2,272
H-index: 25
I10-index: 58
Year
Topic
Type