default search action
Frédéric Maffray
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j129]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): 715-730 (2024) - 2021
- [j128]Frédéric Maffray, Irena Penev
Coloring rings. J. Graph Theory 96(4): 642-683 (2021) - 2020
- [j127]Maria Chudnovsky
Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95(4): 527-542 (2020)
2010 – 2019
- 2019
- [j126]T. Karthick, Frédéric Maffray
Polynomial Cases for the Vertex Coloring Problem. Algorithmica 81(3): 1053-1074 (2019) - [j125]Maria Chudnovsky
Coloring square-free Berge graphs. J. Comb. Theory B 135: 96-128 (2019) - [j124]T. Karthick
Square-Free Graphs with No Six-Vertex Induced Path. SIAM J. Discret. Math. 33(2): 874-909 (2019) - 2018
- [j123]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: 76-85 (2018) - [j122]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): 1449-1458 (2018) - [j121]Nicolas Bousquet
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341(5): 1492-1501 (2018) - [j120]Steven Chaplick
On some graphs with a unique perfect matching. Inf. Process. Lett. 139: 60-63 (2018) - [j119]Maria Chudnovsky
Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory B 131: 12-39 (2018) - [j118]Maria Chudnovsky
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. J. Comb. Theory B 133: 259-260 (2018) - [j117]T. Karthick, Frédéric Maffray
Coloring (gem, co-gem)-free graphs. J. Graph Theory 89(3): 288-303 (2018) - [j116]Pierre Aboulker
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - [i22]T. Karthick, Frédéric Maffray:
Square-free graphs with no six-vertex induced path. CoRR abs/1805.05007 (2018) - [i21]Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. CoRR abs/1810.06186 (2018) - 2017
- [j115]Louis Esperet, Laetitia Lemoine, Frédéric Maffray:
Small Feedback Vertex Sets in Planar Digraphs. Electron. J. Comb. 24(2): 2 (2017) - [j114]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. Discret. Appl. Math. 216: 142-148 (2017) - [j113]T. Karthick, Frédéric Maffray:
Maximum weight independent sets in classes related to claw-free graphs. Discret. Appl. Math. 216: 233-239 (2017) - [j112]Frédéric Maffray, Lucas Pastor:
4-coloring (P6, bull)-free graphs. Discret. Appl. Math. 231: 198-210 (2017) - [j111]Louis Esperet
Long induced paths in graphs. Eur. J. Comb. 62: 1-14 (2017) - [j110]Maria Chudnovsky
Graphs with No Induced Five-Vertex Path or Antipath. J. Graph Theory 84(3): 221-232 (2017) - [i20]Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor:
Decomposition techniques applied to the Clique-Stable set Separation problem. CoRR abs/1703.07106 (2017) - [i19]Frédéric Maffray:
Coloring ($P_5$, bull)-free graphs. CoRR abs/1707.08918 (2017) - [i18]T. Karthick, Frédéric Maffray, Lucas Pastor:
Polynomial Cases for the Vertex Coloring Problem. CoRR abs/1709.07712 (2017) - [i17]Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some Graphs with a Unique Perfect Matching. CoRR abs/1712.04228 (2017) - 2016
- [j109]T. Karthick, Frédéric Maffray:
Weighted independent sets in classes of P6-free graphs. Discret. Appl. Math. 209: 217-226 (2016) - [j108]T. Karthick, Frédéric Maffray:
Vizing Bound for the Chromatic Number on Some Graph Classes. Graphs Comb. 32(4): 1447-1460 (2016) - [j107]Sylvain Gravier, Frédéric Maffray, Lucas Pastor:
On the Choosability of Claw-Free Perfect Graphs. Graphs Comb. 32(6): 2393-2413 (2016) - [c4]T. Karthick, Frédéric Maffray:
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. COCOON 2016: 385-392 - [c3]Frédéric Maffray, Lucas Pastor:
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. WG 2016: 85-96 - [i16]Frédéric Maffray, Lucas Pastor:
The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs. CoRR abs/1602.06817 (2016) - [i15]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 abs/1605.07411 (2016) - [i14]Frédéric Maffray, Lucas Pastor:
Maximum Weight Stable Set in ($P_7$, bull)-free graphs. CoRR abs/1611.09663 (2016) - 2015
- [j106]Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray:
On edge-b-critical graphs. Discret. Appl. Math. 180: 176-180 (2015) - [j105]Simone Dantas, Celina M. H. de Figueiredo
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. Discret. Appl. Math. 182: 15-24 (2015) - [j104]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: 50-61 (2015) - [j103]Jean-Luc Fouquet, Frédéric Maffray:
Domination, coloring and stability in P5-reducible graphs. Discret. Appl. Math. 184: 122-129 (2015) - [j102]Louis Esperet
Equitable partition of graphs into induced forests. Discret. Math. 338(8): 1481-1483 (2015) - [j101]Frédéric Maffray:
Even pairs in square-free Berge graphs. Electron. Notes Discret. Math. 49: 173-180 (2015) - [i13]Frédéric Maffray:
Graphs with no induced wheel or antiwheel. CoRR abs/1502.07484 (2015) - 2014
- [j100]Louis Esperet
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs Comb. 30(2): 365-375 (2014) - [j99]Frédéric Maffray:
Fast recognition of doubled graphs. Theor. Comput. Sci. 516: 96-100 (2014) - [i12]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with no induced five-vertex path or antipath. CoRR abs/1410.0871 (2014) - 2013
- [j98]Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
ERRATUM to: Double domination edge removal critical graphs. Australas. J Comb. 55: 315- (2013) - [j97]Frédéric Maffray, Ana Silva
b-colouring the Cartesian product of trees and some other graphs. Discret. Appl. Math. 161(4-5): 650-669 (2013) - [j96]Louis Esperet
The chromatic number of {P5, K4}-free graphs. Discret. Math. 313(6): 743-754 (2013) - [j95]Louis Esperet
Fire Containment in Planar Graphs. J. Graph Theory 73(3): 267-279 (2013) - [i11]Frédéric Maffray, Nicolas Trotignon:
Algorithms for perfectly contractile graphs. CoRR abs/1309.0435 (2013) - [i10]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs. CoRR abs/1309.0694 (2013) - [i9]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. CoRR abs/1309.0971 (2013) - 2012
- [j94]Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray:
b-coloring of some bipartite graphs. Australas. J Comb. 53: 67-76 (2012) - [j93]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): 471-478 (2012) - [j92]Simone Dantas, Frédéric Maffray, Ana Silva
2k2-partition of some classes of graphs. Discret. Appl. Math. 160(18): 2662-2668 (2012) - [j91]T. Karthick, Frédéric Maffray:
A characterization of claw-free b-perfect graphs. Discret. Math. 312(2): 324-330 (2012) - [j90]Frédéric Maffray, Ana Silva
b-colouring outerplanar graphs with large girth. Discret. Math. 312(10): 1796-1803 (2012) - [j89]Mustapha Chellali, Frédéric Maffray:
Dominator Colorings in Some Classes of Graphs. Graphs Comb. 28(1): 97-107 (2012) - [j88]Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon:
On graphs with no induced subdivision of K4. J. Comb. Theory B 102(4): 924-947 (2012) - [j87]Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales
New Bounds on the Grundy Number of Products of Graphs. J. Graph Theory 71(1): 78-88 (2012) - [j86]Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A Characterization of b-Perfect Graphs. J. Graph Theory 71(1): 95-122 (2012) - [j85]Frédéric Maffray, Grégory Morel:
On 3-Colorable P5-Free Graphs. SIAM J. Discret. Math. 26(4): 1682-1708 (2012) - [j84]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) - 2011
- [j83]Endre Boros
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Ann. Oper. Res. 188(1): 1-18 (2011) - [j82]Simone Dantas, Celina M. H. de Figueiredo
The chain graph sandwich problem. Ann. Oper. Res. 188(1): 133-139 (2011) - [j81]Martin Charles Golumbic, Frédéric Maffray, Grégory Morel:
A characterization of chain probe graphs. Ann. Oper. Res. 188(1): 175-183 (2011) - [j80]Celina M. H. de Figueiredo
Transitive orientations in bull-reducible Berge graphs. Discret. Appl. Math. 159(7): 561-573 (2011) - 2010
- [j79]Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Double domination edge removal critical graphs. Australas. J Comb. 48: 285- (2010) - [j78]Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas:
Connected domination dot-critical graphs. Contributions Discret. Math. 5(2) (2010) - [i8]Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A characterization of b-perfect graphs. CoRR abs/1004.5306 (2010)
2000 – 2009
- 2009
- [j77]Mostafa Blidia, Frédéric Maffray, Zoham Zemir:
On b-colorings in regular graphs. Discret. Appl. Math. 157(8): 1787-1793 (2009) - [j76]Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
Foreword. Discret. Appl. Math. 157(17): 3495-3496 (2009) - [j75]Chính T. Hoàng, Cláudia Linhares Sales
On minimally b-imperfect graphs. Discret. Appl. Math. 157(17): 3519-3530 (2009) - [j74]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Discret. Appl. Math. 157(17): 3540-3551 (2009) - [j73]Victor A. Campos, Cláudia Linhares Sales
b-chromatic number of cacti. Electron. Notes Discret. Math. 35: 281-286 (2009) - [j72]Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon:
On the b-Coloring of Cographs and P4-Sparse Graphs. Graphs Comb. 25(2): 153-167 (2009) - [j71]Frédéric Maffray, Meriem Mechebbek:
On b-perfect Chordal Graphs. Graphs Comb. 25(3): 365-375 (2009) - [j70]Frédéric Maffray:
Stable sets in k-colorable P5-free graphs. Inf. Process. Lett. 109(23-24): 1235-1237 (2009) - [j69]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. J. Graph Theory 61(2): 140-156 (2009) - [j68]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory 62(4): 369-384 (2009) - [j67]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) - 2008
- [j66]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Extremal perfect graphs for a bound on the domination number. Discret. Math. 308(10): 1785-1791 (2008) - [j65]Benjamin Lévêque, Frédéric Maffray:
Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discret. Math. 21(4): 999-1018 (2008) - [j64]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discret. Math. 22(1): 51-71 (2008) - [j63]Cláudia Linhares Sales
On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. 22(1): 329-347 (2008) - [i7]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. CoRR abs/0803.0956 (2008) - 2007
- [j62]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri:
Locating-domination and identifying codes in trees. Australas. J Comb. 39: 219-232 (2007) - [j61]Frédéric Maffray, Dieter Rautenbach:
Small step-dominating sets in trees. Discret. Math. 307(9-10): 1212-1215 (2007) - [j60]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Electron. Notes Discret. Math. 29: 207-211 (2007) - [j59]Vincent Jost
Precoloring Extension of Co-Meyniel Graphs. Graphs Comb. 23(3): 291-301 (2007) - [i6]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. CoRR abs/0711.3958 (2007) - [i5]Frédéric Maffray, Meriem Mechebbek:
On b-perfect chordal graphs. CoRR abs/0711.3959 (2007) - 2006
- [j58]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): 2314-2326 (2006) - [j57]Celina M. H. de Figueiredo
A characterization of P4-comparability graphs. Discret. Math. 306(19-20): 2461-2472 (2006) - [j56]Frédéric Maffray, Nicolas Trotignon:
A class of perfectly contractile graphs. J. Comb. Theory B 96(1): 1-19 (2006) - 2005
- [j55]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
On average lower independence and domination numbers in graphs. Discret. Math. 295(1-3): 1-11 (2005) - [j54]Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray:
Exact double domination in graphs. Discuss. Math. Graph Theory 25(3): 291-302 (2005) - [j53]Benjamin Lévêque, Frédéric Maffray:
Coloring Meyniel graphs in linear time. Electron. Notes Discret. Math. 22: 25-28 (2005) - [j52]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for 3PC(., .)-free Berge graphs. Electron. Notes Discret. Math. 22: 73-77 (2005) - [j51]Frédéric Maffray, Nicolas Trotignon:
Algorithms for Perfectly Contractile Graphs. SIAM J. Discret. Math. 19(3): 553-574 (2005) - [i4]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. CoRR abs/cs/0504082 (2005) - [i3]Vincent Jost, Benjamin Lévêque, Frédéric Maffray:
Precoloring co-Meyniel graphs. CoRR abs/cs/0509004 (2005) - [i2]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) - 2004
- [j50]Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev:
On simplicial and co-simplicial vertices in graphs. Discret. Appl. Math. 138(1-2): 117-132 (2004) - [j49]Simone Dantas, Sylvain Gravier, Frédéric Maffray:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Discret. Appl. Math. 141(1-3): 93-101 (2004) - [j48]Sylvain Gravier, Frédéric Maffray:
On the choice number of claw-free perfect graphs. Discret. Math. 276(1-3): 211-218 (2004) - [j47]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) - [j46]Celina M. H. de Figueiredo
Optimizing Bull-Free Perfect Graphs. SIAM J. Discret. Math. 18(2): 226-240 (2004) - [j45]Cláudia Linhares Sales
On dart-free perfectly contractile graphs. Theor. Comput. Sci. 321(2-3): 171-194 (2004) - [i1]Benjamin Lévêque, Frédéric Maffray:
Coloring Meyniel graphs in linear time. CoRR cs.DM/0405059 (2004) - 2003
- [j44]Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
On a list-coloring problem. Discret. Math. 268(1-3): 303-308 (2003) - [j43]Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray:
Coloring the hypergraph of maximal cliques of a graph with no long path. Discret. Math. 272(2-3): 285-290 (2003) - 2001
- [j42]Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electron. Notes Discret. Math. 7: 22-25 (2001) - [j41]Celina M. H. de Figueiredo
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. Graphs Comb. 17(3): 435-456 (2001) - [j40]Cláudia Linhares Sales
Recognizing Planar Strict Quasi-Parity Graphs. Graphs Comb. 17(4): 745-757 (2001) - 2000
- [c2]Cláudia Linhares Sales
On Dart-Free Perfectly Contractile Graphs. Extended Abstract. LATIN 2000: 135-144
1990 – 1999
- 1999
- [j39]Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer:
Preface. Discret. Appl. Math. 94(1-3): 1 (1999) - [j38]Frédéric Maffray, Myriam Preissmann:
Sequential Colorings and Perfect Graphs. Discret. Appl. Math. 94(1-3): 287-296 (1999) - [j37]Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel:
Some operations preserving the existence of kernels. Discret. Math. 205(1-3): 211-216 (1999) - [j36]Frédéric Maffray, Bruce A. Reed:
A Description of Claw-Free Perfect Graphs. J. Comb. Theory B 75(1): 134-156 (1999) - [j35]Chính T. Hoàng, Frédéric Maffray, Marc Noy:
A characterization of P4-indifference graphs. J. Graph Theory 31(3): 155-162 (1999) - 1998
- [j34]Hacène Aït Haddadène
An algorithm for coloring some perfect graphs. Discret. Math. 183(1-3): 1-16 (1998) - [j33]Cláudia Linhares Sales
Even Pairs in Claw-Free Perfect Graphs. J. Comb. Theory B 74(2): 169-191 (1998) - [j32]Sylvain Gravier, Frédéric Maffray:
Graphs whose choice number is equal to their chromatic number. J. Graph Theory 27(2): 87-97 (1998) - [j31]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. J. Graph Theory 29(4): 209-225 (1998) - 1997
- [j30]Hacène Aït Haddadène
Coloring perfect degenerate graphs. Discret. Math. 163(1-3): 211-215 (1997) - [j29]Hazel Everett, Celina M. H. de Figueiredo
Path parity and perfection. Discret. Math. 165-166: 233-252 (1997) - [j28]Sylvain Gravier, Frédéric Maffray:
Choice number of 3-colorable elementary graphs. Discret. Math. 165-166: 353-358 (1997) - [j27]Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the structure of bull-free perfect graphs. Graphs Comb. 13(1): 31-55 (1997) - [j26]Cláudia Linhares Sales
On Planar Perfectly Contractile Graphs. Graphs Comb. 13(2): 167-187 (1997) - 1996
- [j25]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. 65(1-3): 387-407 (1996) - [j24]Frédéric Maffray, Myriam Preissmann:
On the NP-completeness of the k-colorability problem for triangle-free graphs. Discret. Math. 162(1-3): 313-317 (1996) - [j23]Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory B 67(2): 212-237 (1996) - [j22]András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray:
Minimal non-neighborhood-perfect graphs. J. Graph Theory 21(1): 55-66 (1996) - [j21]Frédéric Maffray, Oscar Porto, Myriam Preissmann:
A generalization of simplicial elimination orderings. J. Graph Theory 23(2): 203-208 (1996) - 1995
- [j20]Frédéric Maffray, Myriam Preissmann:
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture. J. Comb. Theory B 63(2): 294-309 (1995) - 1994
- [j19]Frédéric Maffray, Myriam Preissmann:
Linear Recognition of Pseudo-split Graphs. Discret. Appl. Math. 52(3): 307-312 (1994) - [j18]Frédéric Maffray, Myriam Preissmann:
Perfect graphs with no P 5 and no K 5. Graphs Comb. 10(2-4): 179-184 (1994) - [j17]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On the orientation of meyniel graphs. J. Graph Theory 18(7): 705-711 (1994) - [c1]Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG 1994: 81-92 - 1993
- [j16]Peter L. Hammer, Frédéric Maffray:
Preperfect graphs. Comb. 13(2): 199-208 (1993) - [j15]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On kernels in perfect graphs. Comb. 13(2): 231-233 (1993) - [j14]Leizhen Cai, Frédéric Maffray:
On the SPANNING k-Tree Problem. Discret. Appl. Math. 44(1-3): 139-156 (1993) - [j13]Frédéric Maffray:
Antitwins in partitionable graphs. Discret. Math. 112(1-3): 275-278 (1993) - 1992
- [j12]Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann:
A charming class of perfectly orderable graphs. Discret. Math. 102(1): 67-74 (1992) - [j11]Chính T. Hoàng, Frédéric Maffray:
On slim graphs, even pairs, and star-cutsets. Discret. Math. 105(1-3): 93-102 (1992) - [j10]Frédéric Maffray:
Kernels in perfect line-graphs. J. Comb. Theory B 55(1): 1-8 (1992) - 1991
- [j9]Peter L. Hammer, Frédéric Maffray, Maurice Queyranne:
Cut-threshold graphs. Discret. Appl. Math. 30(2-3): 163-179 (1991) - [j8]Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann:
New properties of perfectly orderable graphs and strongly perfect graphs. Discret. Math. 98(3): 161-174 (1991) - 1990
- [j7]Peter L. Hammer, Frédéric Maffray:
Completely separable graphs. Discret. Appl. Math. 27(1-2): 85-99 (1990) - [j6]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 6(1): 33-35 (1990) - [j5]Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray:
More characterizations of triangulated graphs. J. Graph Theory 14(4): 413-422 (1990)
1980 – 1989
- 1989
- [j4]Chính T. Hoàng, Frédéric Maffray:
Opposition graphs are strict quasi-parity graphs. Graphs Comb. 5(1): 83-85 (1989) - [j3]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 5(1): 339-349 (1989) - 1987
- [j2]Frédéric Maffray, Henry Meyniel:
On a relationship between Hadwiger and stability numbers. Discret. Math. 64(1): 39-42 (1987) - 1986
- [j1]Frédéric Maffray:
On kernels in i-triangulated graphs. Discret. Math. 61(2-3): 247-251 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: