Frédéric Maffray
Frédéric Maffray
Irena Penev
Kristina Vuskovic
Coloring rings.
642-683
2021
96
J. Graph Theory
4
https://doi.org/10.1002/jgt.22635
db/journals/jgt/jgt96.html#MaffrayPV21
Maria Chudnovsky
T. Karthick
Peter Maceli
Frédéric Maffray
Coloring graphs with no induced five-vertex path or gem.
527-542
2020
95
J. Graph Theory
4
https://doi.org/10.1002/jgt.22572
db/journals/jgt/jgt95.html#ChudnovskyTMM20
T. Karthick
Frédéric Maffray
Lucas Pastor
Polynomial Cases for the Vertex Coloring Problem.
1053-1074
2019
81
Algorithmica
3
https://doi.org/10.1007/s00453-018-0457-y
db/journals/algorithmica/algorithmica81.html#KarthickMP19
Maria Chudnovsky
Irene Lo
Frédéric Maffray
Nicolas Trotignon
Kristina Vuskovic
Coloring square-free Berge graphs.
96-128
2019
135
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2018.07.010
https://www.wikidata.org/entity/Q61820851
db/journals/jct/jctb135.html#ChudnovskyLMTV19
T. Karthick
Frédéric Maffray
Square-Free Graphs with No Six-Vertex Induced Path.
874-909
2019
33
SIAM J. Discret. Math.
2
https://doi.org/10.1137/18M1190653
db/journals/siamdm/siamdm33.html#KarthickM19
Dallas J. Fraser
Angèle M. Hamel
Chính T. Hoàng
Frédéric Maffray
A coloring algorithm for -free line graphs.
76-85
2018
234
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2017.06.006
db/journals/dam/dam234.html#FraserHHM18
Frédéric Maffray
Lucas Pastor
Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs.
1449-1458
2018
341
Discret. Math.
5
https://doi.org/10.1016/j.disc.2017.10.004
db/journals/dm/dm341.html#MaffrayP18
Nicolas Bousquet
Aurélie Lagoutte
Frédéric Maffray
Lucas Pastor
Decomposition techniques applied to the Clique-Stable set separation problem.
1492-1501
2018
341
Discret. Math.
5
https://doi.org/10.1016/j.disc.2017.10.014
db/journals/dm/dm341.html#BousquetLMP18
Steven Chaplick
Maximilian Fürst
Frédéric Maffray
Dieter Rautenbach
On some graphs with a unique perfect matching.
60-63
2018
139
Inf. Process. Lett.
https://doi.org/10.1016/j.ipl.2018.07.008
db/journals/ipl/ipl139.html#ChaplickFMR18
Maria Chudnovsky
Frédéric Maffray
Paul D. Seymour
Sophie Spirkl
Even pairs and prism corners in square-free Berge graphs.
12-39
2018
131
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2018.01.003
db/journals/jct/jctb131.html#ChudnovskyMSS18
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].
259-260
2018
133
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2018.07.004
db/journals/jct/jctb133.html#ChudnovskyMSS18a
T. Karthick
Frédéric Maffray
Coloring (gem, co-gem)-free graphs.
288-303
2018
89
J. Graph Theory
3
https://doi.org/10.1002/jgt.22251
db/journals/jgt/jgt89.html#KarthickM18
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.
304-326
2018
89
J. Graph Theory
3
https://doi.org/10.1002/jgt.22252
db/journals/jgt/jgt89.html#AboulkerBBCHMZ18
T. Karthick
Frédéric Maffray
Square-free graphs with no six-vertex induced path.
2018
abs/1805.05007
CoRR
http://arxiv.org/abs/1805.05007
db/journals/corr/corr1805.html#abs-1805-05007
Maria Chudnovsky
T. Karthick
Peter Maceli
Frédéric Maffray
Coloring graphs with no induced five-vertex path or gem.
2018
abs/1810.06186
CoRR
http://arxiv.org/abs/1810.06186
db/journals/corr/corr1810.html#abs-1810-06186
Louis Esperet
Laetitia Lemoine
Frédéric Maffray
Small Feedback Vertex Sets in Planar Digraphs.
2
2017
24
Electron. J. Comb.
2
https://doi.org/10.37236/6252
db/journals/combinatorics/combinatorics24.html#EsperetLM17
Harjinder S. Dhaliwal
Angèle M. Hamel
Chính T. Hoàng
Frédéric Maffray
Tyler J. D. McConnell
Stefan A. Panait
On color-critical (P5, co-P5)-free graphs.
142-148
2017
216
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2016.05.018
db/journals/dam/dam216.html#DhaliwalHHMMP17
T. Karthick
Frédéric Maffray
Maximum weight independent sets in classes related to claw-free graphs.
233-239
2017
216
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2015.02.012
db/journals/dam/dam216.html#KarthickM17
Frédéric Maffray
Lucas Pastor
4-coloring (P6, bull)-free graphs.
198-210
2017
231
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2016.03.011
db/journals/dam/dam231.html#MaffrayP17
Louis Esperet
Laetitia Lemoine
Frédéric Maffray
Long induced paths in graphs.
1-14
2017
62
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2016.11.011
db/journals/ejc/ejc62.html#EsperetLM17
Maria Chudnovsky
Louis Esperet
Laetitia Lemoine
Peter Maceli
Frédéric Maffray
Irena Penev
Graphs with No Induced Five-Vertex Path or Antipath.
221-232
2017
84
J. Graph Theory
3
https://doi.org/10.1002/jgt.22022
db/journals/jgt/jgt84.html#ChudnovskyELMMP17
Nicolas Bousquet
Aurélie Lagoutte
Frédéric Maffray
Lucas Pastor
Decomposition techniques applied to the Clique-Stable set Separation problem.
2017
abs/1703.07106
CoRR
http://arxiv.org/abs/1703.07106
db/journals/corr/corr1703.html#BousquetLMP17
Frédéric Maffray
Coloring ($P_5$, bull)-free graphs.
2017
abs/1707.08918
CoRR
http://arxiv.org/abs/1707.08918
db/journals/corr/corr1707.html#Maffray17
T. Karthick
Frédéric Maffray
Lucas Pastor
Polynomial Cases for the Vertex Coloring Problem.
2017
abs/1709.07712
CoRR
http://arxiv.org/abs/1709.07712
db/journals/corr/corr1709.html#abs-1709-07712
Steven Chaplick
Maximilian Fürst
Frédéric Maffray
Dieter Rautenbach
On some Graphs with a Unique Perfect Matching.
2017
abs/1712.04228
CoRR
http://arxiv.org/abs/1712.04228
db/journals/corr/corr1712.html#abs-1712-04228
T. Karthick
Frédéric Maffray
Weighted independent sets in classes of P6-free graphs.
217-226
2016
209
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2015.10.015
db/journals/dam/dam209.html#KarthickM16
T. Karthick
Frédéric Maffray
Vizing Bound for the Chromatic Number on Some Graph Classes.
1447-1460
2016
32
Graphs Comb.
4
https://doi.org/10.1007/s00373-015-1651-1
db/journals/gc/gc32.html#KarthickM16
Sylvain Gravier
Frédéric Maffray
Lucas Pastor
On the Choosability of Claw-Free Perfect Graphs.
2393-2413
2016
32
Graphs Comb.
6
https://doi.org/10.1007/s00373-016-1732-9
db/journals/gc/gc32.html#GravierMP16
T. Karthick
Frédéric Maffray
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.
385-392
2016
COCOON
https://doi.org/10.1007/978-3-319-42634-1_31
conf/cocoon/2016
db/conf/cocoon/cocoon2016.html#KarthickM16
Frédéric Maffray
Lucas Pastor
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs.
85-96
2016
WG
https://doi.org/10.1007/978-3-662-53536-3_8
conf/wg/2016
db/conf/wg/wg2016.html#MaffrayP16
Frédéric Maffray
Lucas Pastor
The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs.
2016
abs/1602.06817
CoRR
http://arxiv.org/abs/1602.06817
db/journals/corr/corr1602.html#MaffrayP16
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.
2016
abs/1605.07411
CoRR
http://arxiv.org/abs/1605.07411
db/journals/corr/corr1605.html#AboulkerBBCHMZ16
Frédéric Maffray
Lucas Pastor
Maximum Weight Stable Set in ($P_7$, bull)-free graphs.
2016
abs/1611.09663
CoRR
http://arxiv.org/abs/1611.09663
db/journals/corr/corr1611.html#MaffrayP16a
Noureddine Ikhlef Eschouf
Mostafa Blidia
Frédéric Maffray
On edge-b-critical graphs.
176-180
2015
180
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2014.08.012
db/journals/dam/dam180.html#EschoufBM15
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.
15-24
2015
182
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2013.09.004
db/journals/dam/dam182.html#DantasFMT15
Anne Berry
Andreas Brandstädt
Vassilis Giakoumakis
Frédéric Maffray
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds.
50-61
2015
184
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2014.11.018
db/journals/dam/dam184.html#BerryBGM15
Jean-Luc Fouquet
Frédéric Maffray
Domination, coloring and stability in P5-reducible graphs.
122-129
2015
184
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2014.10.013
db/journals/dam/dam184.html#FouquetM15
Louis Esperet
Laetitia Lemoine
Frédéric Maffray
Equitable partition of graphs into induced forests.
1481-1483
2015
338
Discret. Math.
8
https://doi.org/10.1016/j.disc.2015.03.019
db/journals/dm/dm338.html#EsperetLM15
Frédéric Maffray
Even pairs in square-free Berge graphs.
173-180
2015
49
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2015.06.026
db/journals/endm/endm49.html#Maffray15
Frédéric Maffray
Graphs with no induced wheel or antiwheel.
2015
abs/1502.07484
CoRR
http://arxiv.org/abs/1502.07484
db/journals/corr/corr1502.html#Maffray15
Louis Esperet
András Gyárfás
Frédéric Maffray
List-Coloring Claw-Free Graphs with Small Clique Number.
365-375
2014
30
Graphs Comb.
2
https://doi.org/10.1007/s00373-012-1272-x
db/journals/gc/gc30.html#EsperetGM14
Frédéric Maffray
Fast recognition of doubled graphs.
96-100
2014
516
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2013.11.020
db/journals/tcs/tcs516.html#Maffray14
Maria Chudnovsky
Louis Esperet
Laetitia Lemoine
Peter Maceli
Frédéric Maffray
Irena Penev
Graphs with no induced five-vertex path or antipath.
2014
abs/1410.0871
CoRR
http://arxiv.org/abs/1410.0871
db/journals/corr/corr1410.html#ChudnovskyELMMP14
Soufiane Khelifi
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
ERRATUM to: Double domination edge removal critical graphs.
315-
2013
55
Australas. J Comb.
http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p315.pdf
db/journals/ajc/ajc55.html#KhelifiBCM13
Frédéric Maffray
Ana Silva 0001
b-colouring the Cartesian product of trees and some other graphs.
650-669
2013
161
Discret. Appl. Math.
4-5
https://doi.org/10.1016/j.dam.2011.06.019
db/journals/dam/dam161.html#MaffrayS13
Louis Esperet
Laetitia Lemoine
Frédéric Maffray
Grégory Morel
The chromatic number of {P5, K4}-free graphs.
743-754
2013
313
Discret. Math.
6
https://doi.org/10.1016/j.disc.2012.12.019
db/journals/dm/dm313.html#EsperetLMM13
Louis Esperet
Jan van den Heuvel
Frédéric Maffray
Félix Sipma
Fire Containment in Planar Graphs.
267-279
2013
73
J. Graph Theory
3
https://doi.org/10.1002/jgt.21673
db/journals/jgt/jgt73.html#EsperetHMS13
Frédéric Maffray
Nicolas Trotignon
Algorithms for perfectly contractile graphs.
2013
CoRR
http://arxiv.org/abs/1309.0435
abs/1309.0435
db/journals/corr/corr1309.html#MaffrayT13
Frédéric Maffray
Nicolas Trotignon
Kristina Vuskovic
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.
2013
CoRR
http://arxiv.org/abs/1309.0694
abs/1309.0694
db/journals/corr/corr1309.html#MaffrayTV13
Benjamin Lévêque
David Y. Lin
Frédéric Maffray
Nicolas Trotignon
Detecting induced subgraphs.
2013
CoRR
http://arxiv.org/abs/1309.0971
abs/1309.0971
db/journals/corr/corr1309.html#LevequeLMT13
Mostafa Blidia
Noureddine Ikhlef Eschouf
Frédéric Maffray
b-coloring of some bipartite graphs.
67-76
2012
53
Australas. J Comb.
http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p067.pdf
db/journals/ajc/ajc53.html#BlidiaEM12
Andreas Brandstädt
Vassilis Giakoumakis
Frédéric Maffray
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences.
471-478
2012
160
Discret. Appl. Math.
4-5
https://doi.org/10.1016/j.dam.2011.10.031
db/journals/dam/dam160.html#BrandstadtGM12
Simone Dantas
Frédéric Maffray
Ana Silva 0001
2k2-partition of some classes of graphs.
2662-2668
2012
160
Discret. Appl. Math.
18
https://doi.org/10.1016/j.dam.2010.09.009
db/journals/dam/dam160.html#DantasMS12
T. Karthick
Frédéric Maffray
A characterization of claw-free b-perfect graphs.
324-330
2012
312
Discret. Math.
2
https://doi.org/10.1016/j.disc.2011.09.029
db/journals/dm/dm312.html#KarthickM12
Frédéric Maffray
Ana Silva 0001
b-colouring outerplanar graphs with large girth.
1796-1803
2012
312
Discret. Math.
10
https://doi.org/10.1016/j.disc.2012.01.035
db/journals/dm/dm312.html#MaffrayS12
Mustapha Chellali
Frédéric Maffray
Dominator Colorings in Some Classes of Graphs.
97-107
2012
28
Graphs Comb.
1
https://doi.org/10.1007/s00373-010-1012-z
db/journals/gc/gc28.html#ChellaliM12
Benjamin Lévêque
Frédéric Maffray
Nicolas Trotignon
On graphs with no induced subdivision of K4.
924-947
2012
102
J. Comb. Theory, Ser. B
4
https://doi.org/10.1016/j.jctb.2012.04.005
db/journals/jct/jctb102.html#LevequeMT12
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.
78-88
2012
71
J. Graph Theory
1
https://doi.org/10.1002/jgt.20633
db/journals/jgt/jgt71.html#CamposGHSM12
Chính T. Hoàng
Frédéric Maffray
Meriem Mechebbek
A Characterization of b-Perfect Graphs.
95-122
2012
71
J. Graph Theory
1
https://doi.org/10.1002/jgt.20635
db/journals/jgt/jgt71.html#HoangMM12
Frédéric Maffray
Grégory Morel
On 3-Colorable P5-Free Graphs.
1682-1708
2012
26
SIAM J. Discret. Math.
4
https://doi.org/10.1137/110829222
db/journals/siamdm/siamdm26.html#MaffrayM12
Kathie Cameron
Benjamin Lévêque
Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction.
10-17
2012
428
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2011.12.018
db/journals/tcs/tcs428.html#CameronLM12
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.
1-18
2011
188
Ann. Oper. Res.
1
https://doi.org/10.1007/s10479-011-0913-4
https://www.wikidata.org/entity/Q59560542
db/journals/anor/anor188.html#BorosCWHM11
Simone Dantas
Celina M. H. de Figueiredo
Martin Charles Golumbic
Sulamita Klein
Frédéric Maffray
The chain graph sandwich problem.
133-139
2011
188
Ann. Oper. Res.
1
https://doi.org/10.1007/s10479-010-0792-0
db/journals/anor/anor188.html#DantasFGKM11
Martin Charles Golumbic
Frédéric Maffray
Grégory Morel
A characterization of chain probe graphs.
175-183
2011
188
Ann. Oper. Res.
1
https://doi.org/10.1007/s10479-009-0584-6
db/journals/anor/anor188.html#GolumbicMM11
Celina M. H. de Figueiredo
Frédéric Maffray
Cláudia Villela Maciel
Transitive orientations in bull-reducible Berge graphs.
561-573
2011
159
Discret. Appl. Math.
7
https://doi.org/10.1016/j.dam.2010.05.011
db/journals/dam/dam159.html#FigueiredoMM11
Soufiane Khelifi
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
Double domination edge removal critical graphs.
285-
2010
48
Australas. J Comb.
http://ajc.maths.uq.edu.au/pdf/48/ajc_v48_p285.pdf
db/journals/ajc/ajc48.html#KhelifiBCM10
Mustapha Chellali
Frédéric Maffray
Kamel Tablennehas
Connected domination dot-critical graphs.
2010
5
Contributions Discret. Math.
2
http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/188
db/journals/cdm/cdm5.html#ChellaliMT10
Chính T. Hoàng
Frédéric Maffray
Meriem Mechebbek
A characterization of b-perfect graphs
http://arxiv.org/abs/1004.5306
2010
CoRR
abs/1004.5306
db/journals/corr/corr1004.html#abs-1004-5306
Mostafa Blidia
Frédéric Maffray
Zoham Zemir
On b-colorings in regular graphs.
1787-1793
2009
157
Discret. Appl. Math.
8
https://doi.org/10.1016/j.dam.2009.01.007
db/journals/dam/dam157.html#BlidiaMZ09
Luca Maria Gambardella
Alain Hertz
Frédéric Maffray
Marino Widmer
Foreword.
3495-3496
2009
157
Discret. Appl. Math.
17
https://doi.org/10.1016/j.dam.2009.09.012
db/journals/dam/dam157.html#GambardellaHMW09
Chính T. Hoàng
Cláudia Linhares Sales
Frédéric Maffray
On minimally b-imperfect graphs.
3519-3530
2009
157
Discret. Appl. Math.
17
https://doi.org/10.1016/j.dam.2009.02.023
db/journals/dam/dam157.html#HoangSM09
Benjamin Lévêque
David Y. Lin
Frédéric Maffray
Nicolas Trotignon
Detecting induced subgraphs.
3540-3551
2009
157
Discret. Appl. Math.
17
https://doi.org/10.1016/j.dam.2009.02.015
db/journals/dam/dam157.html#LevequeLMT09
Victor A. Campos
Cláudia Linhares Sales
Frédéric Maffray
Ana Silva 0001
b-chromatic number of cacti.
281-286
2009
35
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2009.11.046
db/journals/endm/endm35.html#CamposSMS09
Flavia Bonomo
Guillermo Durán
Frédéric Maffray
Javier Marenco
Mario Valencia-Pabon
On the b-Coloring of Cographs and P4-Sparse Graphs.
153-167
2009
25
Graphs Comb.
2
https://doi.org/10.1007/s00373-008-0829-1
db/journals/gc/gc25.html#BonomoDMMV09
Frédéric Maffray
Meriem Mechebbek
On b-perfect Chordal Graphs.
365-375
2009
25
Graphs Comb.
3
https://doi.org/10.1007/s00373-009-0845-9
db/journals/gc/gc25.html#MaffrayM09
Frédéric Maffray
Stable sets in k-colorable P5-free graphs.
1235-1237
2009
109
Inf. Process. Lett.
23-24
https://doi.org/10.1016/j.ipl.2009.09.006
db/journals/ipl/ipl109.html#Maffray09
Jenö Lehel
Frédéric Maffray
Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction.
140-156
2009
61
J. Graph Theory
2
https://doi.org/10.1002/jgt.20374
db/journals/jgt/jgt61.html#LehelMP09
Benjamin Lévêque
Frédéric Maffray
Myriam Preissmann
Characterizing path graphs by forbidden induced subgraphs.
369-384
2009
62
J. Graph Theory
4
https://doi.org/10.1002/jgt.20407
db/journals/jgt/jgt62.html#LevequeMP09
Benjamin Lévêque
Frédéric Maffray
Bruce A. Reed
Nicolas Trotignon
Coloring Artemis graphs.
2234-2240
2009
410
Theor. Comput. Sci.
21-23
https://doi.org/10.1016/j.tcs.2009.02.012
db/journals/tcs/tcs410.html#LevequeMRT09
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
Extremal perfect graphs for a bound on the domination number.
1785-1791
2008
308
Discret. Math.
10
https://doi.org/10.1016/j.disc.2007.04.027
db/journals/dm/dm308.html#BlidiaCM08
Benjamin Lévêque
Frédéric Maffray
Coloring Bull-Free Perfectly Contractile Graphs.
999-1018
2008
21
SIAM J. Discret. Math.
4
https://doi.org/10.1137/06065948X
db/journals/siamdm/siamdm21.html#LevequeM08
Frédéric Maffray
Nicolas Trotignon
Kristina Vuskovic
Algorithms for Square-3PC(., .)-Free Berge Graphs.
51-71
2008
22
SIAM J. Discret. Math.
1
https://doi.org/10.1137/050628520
https://www.wikidata.org/entity/Q59903865
db/journals/siamdm/siamdm22.html#MaffrayTV08
Cláudia Linhares Sales
Frédéric Maffray
Bruce A. Reed
On Planar Quasi-Parity Graphs.
329-347
2008
22
SIAM J. Discret. Math.
1
https://doi.org/10.1137/060672649
db/journals/siamdm/siamdm22.html#SalesMR08
Benjamin Lévêque
Frédéric Maffray
Myriam Preissmann
Characterizing path graphs by forbidden induced subgraphs
http://arxiv.org/abs/0803.0956
2008
CoRR
abs/0803.0956
db/journals/corr/corr0803.html#abs-0803-0956
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
Julien Moncel
Ahmed Semri
Locating-domination and identifying codes in trees.
219-232
2007
39
Australas. J Comb.
http://ajc.maths.uq.edu.au/pdf/39/ajc_v39_p219.pdf
db/journals/ajc/ajc39.html#BlidiaCMMS07
Frédéric Maffray
Dieter Rautenbach
Small step-dominating sets in trees.
1212-1215
2007
307
Discret. Math.
9-10
https://doi.org/10.1016/j.disc.2006.07.038
db/journals/dm/dm307.html#MaffrayR07
Benjamin Lévêque
David Y. Lin
Frédéric Maffray
Nicolas Trotignon
Detecting induced subgraphs.
207-211
2007
29
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2007.07.036
db/journals/endm/endm29.html#LevequeLMT07
Vincent Jost
Benjamin Lévêque
Frédéric Maffray
Precoloring Extension of Co-Meyniel Graphs.
291-301
2007
23
Graphs Comb.
3
https://doi.org/10.1007/s00373-007-0724-1
db/journals/gc/gc23.html#JostLM07
Jenö Lehel
Frédéric Maffray
Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction
http://arxiv.org/abs/0711.3958
2007
CoRR
abs/0711.3958
db/journals/corr/corr0711.html#abs-0711-3958
Frédéric Maffray
Meriem Mechebbek
On b-perfect chordal graphs
http://arxiv.org/abs/0711.3959
2007
CoRR
abs/0711.3959
db/journals/corr/corr0711.html#abs-0711-3959
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
Extremal graphs for a new upper bound on domination parameters in graphs.
2314-2326
2006
306
Discret. Math.
19-20
https://doi.org/10.1016/j.disc.2005.12.029
db/journals/dm/dm306.html#BlidiaCM06
Celina M. H. de Figueiredo
Chính T. Hoàng
Frédéric Maffray
A characterization of P4-comparability graphs.
2461-2472
2006
306
Discret. Math.
19-20
https://doi.org/10.1016/j.disc.2006.05.018
db/journals/dm/dm306.html#FigueiredoHM06
Frédéric Maffray
Nicolas Trotignon
A class of perfectly contractile graphs.
1-19
2006
96
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/j.jctb.2005.06.011
db/journals/jct/jctb96.html#MaffrayT06
Mostafa Blidia
Mustapha Chellali
Frédéric Maffray
On average lower independence and domination numbers in graphs.
1-11
2005
295
Discret. Math.
1-3
https://doi.org/10.1016/j.disc.2004.12.006
db/journals/dm/dm295.html#BlidiaCM05
Mustapha Chellali
Abdelkader Khelladi
Frédéric Maffray
Exact double domination in graphs.
291-302
2005
25
Discuss. Math. Graph Theory
3
https://doi.org/10.7151/dmgt.1282
db/journals/dmgt/dmgt25.html#ChellaliKM05
Benjamin Lévêque
Frédéric Maffray
Coloring Meyniel graphs in linear time.
25-28
2005
22
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2005.06.005
db/journals/endm/endm22.html#LevequeM05
Frédéric Maffray
Nicolas Trotignon
Kristina Vuskovic
Algorithms for 3PC(., .)-free Berge graphs.
73-77
2005
22
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2005.06.013
https://www.wikidata.org/entity/Q57949153
db/journals/endm/endm22.html#MaffrayTV05
Frédéric Maffray
Nicolas Trotignon
Algorithms for Perfectly Contractile Graphs.
553-574
2005
19
SIAM J. Discret. Math.
3
https://doi.org/10.1137/S0895480104442522
db/journals/siamdm/siamdm19.html#MaffrayT05
Benjamin Lévêque
Frédéric Maffray
Bruce A. Reed
Nicolas Trotignon
Coloring Artemis graphs
http://arxiv.org/abs/cs/0504082
2005
CoRR
abs/cs/0504082
db/journals/corr/corr0504.html#abs-cs-0504082
Vincent Jost
Benjamin Lévêque
Frédéric Maffray
Precoloring co-Meyniel graphs
http://arxiv.org/abs/cs/0509004
2005
CoRR
abs/cs/0509004
db/journals/corr/corr0509.html#abs-cs-0509004
Kathie Cameron
Jack Edmonds 0001
Benjamin Lévêque
Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction
http://arxiv.org/abs/cs/0509023
2005
CoRR
abs/cs/0509023
db/journals/corr/corr0509.html#abs-cs-0509023
Chính T. Hoàng
Stefan Hougardy
Frédéric Maffray
Nadimpalli V. R. Mahadev
On simplicial and co-simplicial vertices in graphs.
117-132
2004
138
Discret. Appl. Math.
1-2
https://doi.org/10.1016/S0166-218X(03)00275-0
db/journals/dam/dam138.html#HoangHMM04
Simone Dantas
Sylvain Gravier
Frédéric Maffray
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
93-101
2004
141
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(03)00377-9
db/journals/dam/dam141.html#DantasGM04
Sylvain Gravier
Frédéric Maffray
On the choice number of claw-free perfect graphs.
211-218
2004
276
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(03)00292-9
https://www.wikidata.org/entity/Q56444938
db/journals/dm/dm276.html#GravierM04
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.
719-734
2004
25
Eur. J. Comb.
5
https://doi.org/10.1016/j.ejc.2003.10.004
db/journals/ejc/ejc25.html#GravierMRT04
Celina M. H. de Figueiredo
Frédéric Maffray
Optimizing Bull-Free Perfect Graphs.
226-240
2004
18
SIAM J. Discret. Math.
2
https://doi.org/10.1137/S0895480198339237
db/journals/siamdm/siamdm18.html#FigueiredoM04
Cláudia Linhares Sales
Frédéric Maffray
On dart-free perfectly contractile graphs.
171-194
2004
321
Theor. Comput. Sci.
2-3
https://doi.org/10.1016/j.tcs.2003.11.026
db/journals/tcs/tcs321.html#SalesM04
Benjamin Lévêque
Frédéric Maffray
Coloring Meyniel graphs in linear time
http://arxiv.org/abs/cs.DM/0405059
2004
CoRR
cs.DM/0405059
db/journals/corr/corr0405.html#cs-DM-0405059
Sylvain Gravier
Frédéric Maffray
Bojan Mohar
On a list-coloring problem.
303-308
2003
268
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(03)00033-5
db/journals/dm/dm268.html#GravierMM03
Sylvain Gravier
Chính T. Hoàng
Frédéric Maffray
Coloring the hypergraph of maximal cliques of a graph with no long path.
285-290
2003
272
Discret. Math.
2-3
https://doi.org/10.1016/S0012-365X(03)00197-3
db/journals/dm/dm272.html#GravierHM03
Simone Dantas
Sylvain Gravier
Frédéric Maffray
Bojan Mohar
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
22-25
2001
7
Electron. Notes Discret. Math.
https://doi.org/10.1016/S1571-0653(04)00215-X
db/journals/endm/endm7.html#DantasGMM01
Celina M. H. de Figueiredo
Frédéric Maffray
Oscar Porto
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.
435-456
2001
17
Graphs Comb.
3
https://doi.org/10.1007/s003730170019
db/journals/gc/gc17.html#FigueiredoMP01
Cláudia Linhares Sales
Frédéric Maffray
Bruce A. Reed
Recognizing Planar Strict Quasi-Parity Graphs.
745-757
2001
17
Graphs Comb.
4
https://doi.org/10.1007/s003730170014
db/journals/gc/gc17.html#SalesMR01
Cláudia Linhares Sales
Frédéric Maffray
On Dart-Free Perfectly Contractile Graphs. Extended Abstract.
135-144
2000
conf/latin/2000
LATIN
db/conf/latin/latin2000.html#SalesM00
https://doi.org/10.1007/10719839_15
Jacques Carlier
Alain Hertz
Frédéric Maffray
Marino Widmer
Preface.
1
1999
94
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(99)80005-5
db/journals/dam/dam94.html#CarlierHMW99
Frédéric Maffray
Myriam Preissmann
Sequential Colorings and Perfect Graphs.
287-296
1999
94
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(99)00026-8
db/journals/dam/dam94.html#MaffrayP99
Mostafa Blidia
Pierre Duchet
Henry Jacob
Frédéric Maffray
Henry Meyniel
Some operations preserving the existence of kernels.
211-216
1999
205
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(99)00026-6
db/journals/dm/dm205.html#BlidiaDJMM99
Frédéric Maffray
Bruce A. Reed
A Description of Claw-Free Perfect Graphs.
134-156
1999
75
J. Comb. Theory, Ser. B
1
https://doi.org/10.1006/jctb.1998.1872
db/journals/jct/jctb75.html#MaffrayR99
Chính T. Hoàng
Frédéric Maffray
Marc Noy
A characterization of P4-indifference graphs.
155-162
1999
31
J. Graph Theory
3
https://doi.org/10.1002/(SICI)1097-0118(199907)31:3<155::AID-JGT1>3.0.CO;2-R
db/journals/jgt/jgt31.html#HoangMN99
Hacène Aït Haddadène
Sylvain Gravier
Frédéric Maffray
An algorithm for coloring some perfect graphs.
1-16
1998
183
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(97)00082-4
db/journals/dm/dm183.html#HaddadeneGM98
Cláudia Linhares Sales
Frédéric Maffray
Even Pairs in Claw-Free Perfect Graphs.
169-191
1998
74
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1998.1841
db/journals/jct/jctb74.html#SalesM98
Sylvain Gravier
Frédéric Maffray
Graphs whose choice number is equal to their chromatic number.
87-97
1998
27
J. Graph Theory
2
https://doi.org/10.1002/(SICI)1097-0118(199802)27:2<87::AID-JGT4>3.0.CO;2-B
db/journals/jgt/jgt27.html#GravierM98
Gábor Bacsó
Endre Boros
Vladimir Gurvich
Frédéric Maffray
Myriam Preissmann
On minimal imperfect graphs with circular symmetry.
209-225
1998
29
J. Graph Theory
4
https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<209::AID-JGT1>3.0.CO;2-V
db/journals/jgt/jgt29.html#BacsoBGMP98
Hacène Aït Haddadène
Frédéric Maffray
Coloring perfect degenerate graphs.
211-215
1997
163
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(96)00009-X
db/journals/dm/dm163.html#HaddadeneM97
Hazel Everett
Celina M. H. de Figueiredo
Cláudia Linhares Sales
Frédéric Maffray
Oscar Porto
Bruce A. Reed
Path parity and perfection.
233-252
1997
165-166
Discret. Math.
https://doi.org/10.1016/S0012-365X(96)00174-4
db/journals/dm/dm165.html#EverettFSMPR97
Sylvain Gravier
Frédéric Maffray
Choice number of 3-colorable elementary graphs.
353-358
1997
165-166
Discret. Math.
https://doi.org/10.1016/S0012-365X(96)00182-3
db/journals/dm/dm165.html#GravierM97
Celina M. H. de Figueiredo
Frédéric Maffray
Oscar Porto
On the structure of bull-free perfect graphs.
31-55
1997
13
Graphs Comb.
1
https://doi.org/10.1007/BF01202235
db/journals/gc/gc13.html#FigueiredoMP97
Cláudia Linhares Sales
Frédéric Maffray
Bruce A. Reed
On Planar Perfectly Contractile Graphs.
167-187
1997
13
Graphs Comb.
2
https://doi.org/10.1007/BF03352994
db/journals/gc/gc13.html#SalesMR97
Jenö Lehel
Frédéric Maffray
Myriam Preissmann
Graphs with Largest Number of Minimum Cuts.
387-407
1996
65
Discret. Appl. Math.
1-3
https://doi.org/10.1016/0166-218X(95)00043-Q
db/journals/dam/dam65.html#LehelMP96
Frédéric Maffray
Myriam Preissmann
On the NP-completeness of the k-colorability problem for triangle-free graphs.
313-317
1996
162
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(97)89267-9
db/journals/dm/dm162.html#MaffrayP96
Chính T. Hoàng
Stefan Hougardy
Frédéric Maffray
On the P4-Structure of Perfect Graphs V. Overlap Graphs.
212-237
1996
67
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1996.0042
db/journals/jct/jctb67.html#HoangHM96
András Gyárfás
Dieter Kratsch
Jenö Lehel
Frédéric Maffray
Minimal non-neighborhood-perfect graphs.
55-66
1996
21
J. Graph Theory
1
https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<55::AID-JGT8>3.0.CO;2-L
db/journals/jgt/jgt21.html#GyarfasKLM96
Frédéric Maffray
Oscar Porto
Myriam Preissmann
A generalization of simplicial elimination orderings.
203-208
1996
23
J. Graph Theory
2
https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<203::AID-JGT11>3.0.CO;2-H
db/journals/jgt/jgt23.html#MaffrayPP96
Frédéric Maffray
Myriam Preissmann
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
294-309
1995
63
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1995.1021
db/journals/jct/jctb63.html#MaffrayP95
Frédéric Maffray
Myriam Preissmann
Linear Recognition of Pseudo-split Graphs.
307-312
1994
52
Discret. Appl. Math.
3
https://doi.org/10.1016/0166-218X(94)00022-0
db/journals/dam/dam52.html#MaffrayP94
Frédéric Maffray
Myriam Preissmann
Perfect graphs with no P 5 and no K 5.
179-184
1994
10
Graphs Comb.
2-4
https://doi.org/10.1007/BF02986662
db/journals/gc/gc10.html#MaffrayP94
Mostafa Blidia
Pierre Duchet
Frédéric Maffray
On the orientation of meyniel graphs.
705-711
1994
18
J. Graph Theory
7
https://doi.org/10.1002/jgt.3190180706
db/journals/jgt/jgt18.html#BlidiaDM94
Elias Dahlhaus
Peter L. Hammer
Frédéric Maffray
Stephan Olariu
On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
81-92
1994
conf/wg/1994
WG
db/conf/wg/wg94.html#DahlhausHMO94
https://doi.org/10.1007/3-540-59071-4_39
Peter L. Hammer
Frédéric Maffray
Preperfect graphs.
199-208
1993
13
Comb.
2
db/journals/combinatorica/combinatorica13.html#HammerM93
https://doi.org/10.1007/BF01303204
Mostafa Blidia
Pierre Duchet
Frédéric Maffray
On kernels in perfect graphs.
231-233
1993
13
Comb.
2
db/journals/combinatorica/combinatorica13.html#BlidiaDM93
https://doi.org/10.1007/BF01303206
Leizhen Cai
Frédéric Maffray
On the SPANNING k-Tree Problem.
139-156
1993
44
Discret. Appl. Math.
1-3
db/journals/dam/dam44.html#CaiM93
https://doi.org/10.1016/0166-218X(93)90228-G
Frédéric Maffray
Antitwins in partitionable graphs.
275-278
1993
112
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(93)90242-L
db/journals/dm/dm112.html#Maffray93
Chính T. Hoàng
Frédéric Maffray
Stephan Olariu
Myriam Preissmann
A charming class of perfectly orderable graphs.
67-74
1992
102
Discret. Math.
1
https://doi.org/10.1016/0012-365X(92)90348-J
db/journals/dm/dm102.html#HoangMOP92
Chính T. Hoàng
Frédéric Maffray
On slim graphs, even pairs, and star-cutsets.
93-102
1992
105
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(92)90134-2
db/journals/dm/dm105.html#HoangM92
Frédéric Maffray
Kernels in perfect line-graphs.
1-8
1992
55
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/0095-8956(92)90028-V
https://www.wikidata.org/entity/Q56388847
db/journals/jct/jctb55.html#Maffray92
Peter L. Hammer
Frédéric Maffray
Maurice Queyranne
Cut-threshold graphs.
163-179
1991
30
Discret. Appl. Math.
2-3
https://doi.org/10.1016/0166-218X(91)90042-U
db/journals/dam/dam30.html#HammerMQ91
Chính T. Hoàng
Frédéric Maffray
Myriam Preissmann
New properties of perfectly orderable graphs and strongly perfect graphs.
161-174
1991
98
Discret. Math.
3
https://doi.org/10.1016/0012-365X(91)90373-A
db/journals/dm/dm98.html#HoangMP91
Peter L. Hammer
Frédéric Maffray
Completely separable graphs.
85-99
1990
27
Discret. Appl. Math.
1-2
https://doi.org/10.1016/0166-218X(90)90131-U
db/journals/dam/dam27.html#HammerM90
Ryan Hayward
Chính T. Hoàng
Frédéric Maffray
Optimizing weakly triangulated graphs.
33-35
1990
6
Graphs Comb.
1
https://doi.org/10.1007/BF01787477
db/journals/gc/gc6.html#HaywardHM90
Claude Benzaken
Yves Crama
Pierre Duchet
Peter L. Hammer
Frédéric Maffray
More characterizations of triangulated graphs.
413-422
1990
14
J. Graph Theory
4
https://doi.org/10.1002/jgt.3190140404
db/journals/jgt/jgt14.html#BenzakenCDHM90
Chính T. Hoàng
Frédéric Maffray
Opposition graphs are strict quasi-parity graphs.
83-85
1989
5
Graphs Comb.
1
https://doi.org/10.1007/BF01788660
db/journals/gc/gc5.html#HoangM89
Ryan Hayward
Chính T. Hoàng
Frédéric Maffray
Optimizing weakly triangulated graphs.
339-349
1989
5
Graphs Comb.
1
https://doi.org/10.1007/BF01788689
https://www.wikidata.org/entity/Q56656645
db/journals/gc/gc5.html#HaywardHM89
Frédéric Maffray
Henry Meyniel
On a relationship between Hadwiger and stability numbers.
39-42
1987
64
Discret. Math.
1
https://doi.org/10.1016/0012-365X(87)90238-X
db/journals/dm/dm64.html#MaffrayM87
Frédéric Maffray
On kernels in i-triangulated graphs.
247-251
1986
61
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(86)90095-6
db/journals/dm/dm61.html#Maffray86
Pierre Aboulker
Gábor Bacsó
Jørgen Bang-Jensen
Claude Benzaken
Anne Berry
Mostafa Blidia
Flavia Bonomo-BrabermanFlavia Bonomo
Endre Boros
Nicolas Bousquet
Andreas Brandstädt
Leizhen Cai
Kathie Cameron
Victor A. Campos
Jacques Carlier
Steven Chaplick
Pierre Charbit
Mustapha Chellali
Maria Chudnovsky
Yves Crama
Elias Dahlhaus
Simone Dantas
Harjinder S. Dhaliwal
Pierre Duchet
Guillermo Durán
Jack Edmonds 0001
Noureddine Ikhlef Eschouf
Louis Esperet
Hazel Everett
Celina M. H. de Figueiredo
Angèle M. FoleyAngèle M. Hamel
Jean-Luc Fouquet
Dallas J. Fraser
Maximilian Fürst
Luca Maria Gambardella
Vassilis Giakoumakis
Martin Charles Golumbic
Sylvain Gravier
Vladimir Gurvich
András Gyárfás
Hacène Aït Haddadène
Peter L. Hammer
Pierre Hansen
Frédéric Havet
Ryan B. HaywardRyan Hayward
Alain Hertz
Jan van den Heuvel
Chính T. Hoàng
Stefan Hougardy
Henry Jacob
Vincent Jost
T. Karthick
Soufiane Khelifi
Abdelkader Khelladi
Sulamita Klein
Dieter Kratsch
Aurélie Lagoutte
Jenö Lehel
Laetitia Lemoine
Benjamin Lévêque
David Y. Lin
Irene Lo
Peter Maceli
Cláudia Villela Maciel
Nadimpalli V. R. Mahadev
Javier Marenco
Tyler J. D. McConnell
Meriem Mechebbek
Henry Meyniel
Bojan Mohar
Julien Moncel
Grégory Morel
Marc Noy
Stephan Olariu
Stefan A. Panait
Lucas Pastor
Irena Penev
Oscar Porto
Myriam Preissmann
Maurice Queyranne
Dieter Rautenbach
Bruce A. Reed
Jérôme Renault
Cláudia Linhares Sales
Ahmed Semri
Paul D. Seymour
Ana Silva 0001
Félix Sipma
Sophie Spirkl
Kamel Tablennehas
Rafael B. Teixeira
Nicolas Trotignon
Mario Valencia-Pabon
Kristina Vuskovic
Dominique de Werra
Marino Widmer
José Zamora
Zoham Zemir