Frédéric Maffray

155 papers B 3Misc 1Journal 151
YearRankTypeTitle / Venue / Authors
2024 J jnl
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.
Ann. Oper. Res.
Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray
2021 J jnl
Coloring rings.
J. Graph Theory
Frédéric Maffray, Irena Penev, Kristina Vuskovic
2020 J jnl
Coloring graphs with no induced five-vertex path or gem.
J. Graph Theory
Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray
2019 J jnl
Coloring square-free Berge graphs.
J. Comb. Theory B
Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
2019 J jnl
Polynomial Cases for the Vertex Coloring Problem.
Algorithmica
T. Karthick, Frédéric Maffray, Lucas Pastor
2019 J jnl
Square-Free Graphs with No Six-Vertex Induced Path.
SIAM J. Discret. Math.
T. Karthick, Frédéric Maffray
2018 J jnl
A coloring algorithm for -free line graphs.
Discret. Appl. Math.
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray
2018 J jnl
Coloring (gem, co-gem)-free graphs.
J. Graph Theory
T. Karthick, Frédéric Maffray
2018 J jnl
Coloring graphs with no induced five-vertex path or gem.
CoRR
Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray
2018 J jnl
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
Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
2018 J jnl
Decomposition techniques applied to the Clique-Stable set separation problem.
Discret. Math.
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
2018 J jnl
Even pairs and prism corners in square-free Berge graphs.
J. Comb. Theory B
Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
2018 J jnl
Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs.
Discret. Math.
Frédéric Maffray, Lucas Pastor
2018 J jnl
On some graphs with a unique perfect matching.
Inf. Process. Lett.
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
2018 J jnl
Square-free graphs with no six-vertex induced path.
CoRR
T. Karthick, Frédéric Maffray
2018 J jnl
χ-bounded families of oriented graphs.
J. Graph Theory
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2017 J jnl
4-coloring (P6, bull)-free graphs.
Discret. Appl. Math.
Frédéric Maffray, Lucas Pastor
2017 J jnl
Coloring ($P_5$, bull)-free graphs.
CoRR
Frédéric Maffray
2017 J jnl
Decomposition techniques applied to the Clique-Stable set Separation problem.
CoRR
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
2017 J jnl
Graphs with No Induced Five-Vertex Path or Antipath.
J. Graph Theory
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
2017 J jnl
Long induced paths in graphs.
Eur. J. Comb.
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
2017 J jnl
Maximum weight independent sets in classes related to claw-free graphs.
Discret. Appl. Math.
T. Karthick, Frédéric Maffray
2017 J jnl
On color-critical (P
Discret. Appl. Math.
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
2017 J jnl
On some Graphs with a Unique Perfect Matching.
CoRR
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
2017 J jnl
Polynomial Cases for the Vertex Coloring Problem.
CoRR
T. Karthick, Frédéric Maffray, Lucas Pastor
2017 J jnl
Small Feedback Vertex Sets in Planar Digraphs.
Electron. J. Comb.
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
2016 J jnl
$χ$-bounded families of oriented graphs.
CoRR
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2016 Misc conf
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.
COCOON
T. Karthick, Frédéric Maffray
2016 J jnl
Maximum Weight Stable Set in ($P_7$, bull)-free graphs.
CoRR
Frédéric Maffray, Lucas Pastor
2016 J jnl
On the Choosability of Claw-Free Perfect Graphs.
Graphs Comb.
Sylvain Gravier, Frédéric Maffray, Lucas Pastor
2016 B conf
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs.
WG
Frédéric Maffray, Lucas Pastor
2016 J jnl
The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs.
CoRR
Frédéric Maffray, Lucas Pastor
2016 J jnl
Vizing Bound for the Chromatic Number on Some Graph Classes.
Graphs Comb.
T. Karthick, Frédéric Maffray
2016 J jnl
Weighted independent sets in classes of P
Discret. Appl. Math.
T. Karthick, Frédéric Maffray
2015 J jnl
Domination, coloring and stability in P5-reducible graphs.
Discret. Appl. Math.
Jean-Luc Fouquet, Frédéric Maffray
2015 J jnl
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds.
Discret. Appl. Math.
Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
2015 J jnl
Equitable partition of graphs into induced forests.
Discret. Math.
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
2015 J jnl
Even pairs in square-free Berge graphs.
Electron. Notes Discret. Math.
Frédéric Maffray
2015 J jnl
Graphs with no induced wheel or antiwheel.
CoRR
Frédéric Maffray
2015 J jnl
On edge-b-critical graphs.
Discret. Appl. Math.
Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray
2015 J jnl
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira
2014 J jnl
Fast recognition of doubled graphs.
Theor. Comput. Sci.
Frédéric Maffray
2014 J jnl
Graphs with no induced five-vertex path or antipath.
CoRR
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
2014 J jnl
List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs Comb.
Louis Esperet, András Gyárfás, Frédéric Maffray
2013 J jnl
Algorithms for perfectly contractile graphs.
CoRR
Frédéric Maffray, Nicolas Trotignon
2013 J jnl
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.
CoRR
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
2013 J jnl
Detecting induced subgraphs.
CoRR
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2013 J jnl
ERRATUM to: Double domination edge removal critical graphs.
Australas. J Comb.
Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
2013 J jnl
Fire Containment in Planar Graphs.
J. Graph Theory
Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma
2013 J jnl
The chromatic number of {
Discret. Math.
Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel
2013 J jnl
b-colouring the Cartesian product of trees and some other graphs.
Discret. Appl. Math.
Frédéric Maffray, Ana Silva
2012 J jnl
2k
Discret. Appl. Math.
Simone Dantas, Frédéric Maffray, Ana Silva
2012 J jnl
A Characterization of b-Perfect Graphs.
J. Graph Theory
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
2012 J jnl
A characterization of claw-free b-perfect graphs.
Discret. Math.
T. Karthick, Frédéric Maffray
2012 J jnl
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences.
Discret. Appl. Math.
Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
2012 J jnl
Coloring vertices of a graph or finding a Meyniel obstruction.
Theor. Comput. Sci.
Kathie Cameron, Benjamin Lévêque, Frédéric Maffray
2012 J jnl
Dominator Colorings in Some Classes of Graphs.
Graphs Comb.
Mustapha Chellali, Frédéric Maffray
2012 J jnl
New Bounds on the Grundy Number of Products of Graphs.
J. Graph Theory
Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray
2012 J jnl
On 3-Colorable P
SIAM J. Discret. Math.
Frédéric Maffray, Grégory Morel
2012 J jnl
On graphs with no induced subdivision of K
J. Comb. Theory B
Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon
2012 J jnl
b-coloring of some bipartite graphs.
Australas. J Comb.
Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray
2012 J jnl
b-colouring outerplanar graphs with large girth.
Discret. Math.
Frédéric Maffray, Ana Silva
2011 J jnl
A characterization of chain probe graphs.
Ann. Oper. Res.
Martin Charles Golumbic, Frédéric Maffray, Grégory Morel
2011 J jnl
The chain graph sandwich problem.
Ann. Oper. Res.
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
2011 J jnl
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res.
Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray
2011 J jnl
Transitive orientations in bull-reducible Berge graphs.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel
2010 J jnl
A characterization of b-perfect graphs
CoRR
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
2010 J jnl
Connected domination dot-critical graphs.
Contributions Discret. Math.
Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas
2010 J jnl
Double domination edge removal critical graphs.
Australas. J Comb.
Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
2009 J jnl
Characterizing path graphs by forbidden induced subgraphs.
J. Graph Theory
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2009 J jnl
Coloring Artemis graphs.
Theor. Comput. Sci.
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2009 J jnl
Detecting induced subgraphs.
Discret. Appl. Math.
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2009 J jnl
Foreword.
Discret. Appl. Math.
Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
2009 J jnl
Maximum directed cuts in digraphs with degree restriction.
J. Graph Theory
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2009 J jnl
On b-colorings in regular graphs.
Discret. Appl. Math.
Mostafa Blidia, Frédéric Maffray, Zoham Zemir
2009 J jnl
On b-perfect Chordal Graphs.
Graphs Comb.
Frédéric Maffray, Meriem Mechebbek
2009 J jnl
On minimally b-imperfect graphs.
Discret. Appl. Math.
Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray
2009 J jnl
On the b-Coloring of Cographs and
Graphs Comb.
Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon
2009 J jnl
Stable sets in k-colorable P
Inf. Process. Lett.
Frédéric Maffray
2009 J jnl
b-chromatic number of cacti.
Electron. Notes Discret. Math.
Victor A. Campos, Cláudia Linhares Sales, Frédéric Maffray, Ana Silva
2008 J jnl
Algorithms for Square-3PC(., .)-Free Berge Graphs.
SIAM J. Discret. Math.
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
2008 J jnl
Characterizing path graphs by forbidden induced subgraphs
CoRR
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2008 J jnl
Coloring Bull-Free Perfectly Contractile Graphs.
SIAM J. Discret. Math.
Benjamin Lévêque, Frédéric Maffray
2008 J jnl
Extremal perfect graphs for a bound on the domination number.
Discret. Math.
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
2008 J jnl
On Planar Quasi-Parity Graphs.
SIAM J. Discret. Math.
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
2007 J jnl
Detecting induced subgraphs.
Electron. Notes Discret. Math.
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2007 J jnl
Locating-domination and identifying codes in trees.
Australas. J Comb.
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri
2007 J jnl
Maximum directed cuts in digraphs with degree restriction
CoRR
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2007 J jnl
On b-perfect chordal graphs
CoRR
Frédéric Maffray, Meriem Mechebbek
2007 J jnl
Precoloring Extension of Co-Meyniel Graphs.
Graphs Comb.
Vincent Jost, Benjamin Lévêque, Frédéric Maffray
2007 J jnl
Small step-dominating sets in trees.
Discret. Math.
Frédéric Maffray, Dieter Rautenbach
2006 J jnl
A characterization of P
Discret. Math.
Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray
2006 J jnl
A class of perfectly contractile graphs.
J. Comb. Theory B
Frédéric Maffray, Nicolas Trotignon
2006 J jnl
Extremal graphs for a new upper bound on domination parameters in graphs.
Discret. Math.
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
2005 J jnl
Algorithms for 3PC(., .)-free Berge graphs.
Electron. Notes Discret. Math.
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
2005 J jnl
Algorithms for Perfectly Contractile Graphs.
SIAM J. Discret. Math.
Frédéric Maffray, Nicolas Trotignon
2005 J jnl
Coloring Artemis graphs
CoRR
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2005 J jnl
Coloring Meyniel graphs in linear time.
Electron. Notes Discret. Math.
Benjamin Lévêque, Frédéric Maffray
2005 J jnl
Coloring vertices of a graph or finding a Meyniel obstruction
CoRR
Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray
2005 J jnl
Exact double domination in graphs.
Discuss. Math. Graph Theory
Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray
2005 J jnl
On average lower independence and domination numbers in graphs.
Discret. Math.
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
2005 J jnl
Precoloring co-Meyniel graphs
CoRR
Vincent Jost, Benjamin Lévêque, Frédéric Maffray
2004 J jnl
Coloring Meyniel graphs in linear time
CoRR
Benjamin Lévêque, Frédéric Maffray
2004 J jnl
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Discret. Appl. Math.
Simone Dantas, Sylvain Gravier, Frédéric Maffray
2004 J jnl
On dart-free perfectly contractile graphs.
Theor. Comput. Sci.
Cláudia Linhares Sales, Frédéric Maffray
2004 J jnl
On simplicial and co-simplicial vertices in graphs.
Discret. Appl. Math.
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
2004 J jnl
On the choice number of claw-free perfect graphs.
Discret. Math.
Sylvain Gravier, Frédéric Maffray
2004 J jnl
Optimizing Bull-Free Perfect Graphs.
SIAM J. Discret. Math.
Celina M. H. de Figueiredo, Frédéric Maffray
2004 J jnl
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.
Eur. J. Comb.
Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon
2003 J jnl
Coloring the hypergraph of maximal cliques of a graph with no long path.
Discret. Math.
Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
2003 J jnl
On a list-coloring problem.
Discret. Math.
Sylvain Gravier, Frédéric Maffray, Bojan Mohar
2001 J jnl
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electron. Notes Discret. Math.
Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar
2001 J jnl
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.
Graphs Comb.
Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto
2001 J jnl
Recognizing Planar Strict Quasi-Parity Graphs.
Graphs Comb.
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
2000 B conf
On Dart-Free Perfectly Contractile Graphs. Extended Abstract.
LATIN
Cláudia Linhares Sales, Frédéric Maffray
1999 J jnl
A Description of Claw-Free Perfect Graphs.
J. Comb. Theory B
Frédéric Maffray, Bruce A. Reed
1999 J jnl
A characterization of
J. Graph Theory
Chính T. Hoàng, Frédéric Maffray, Marc Noy
1999 J jnl
Preface.
Discret. Appl. Math.
Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer
1999 J jnl
Sequential Colorings and Perfect Graphs.
Discret. Appl. Math.
Frédéric Maffray, Myriam Preissmann
1999 J jnl
Some operations preserving the existence of kernels.
Discret. Math.
Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel
1998 J jnl
An algorithm for coloring some perfect graphs.
Discret. Math.
Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray
1998 J jnl
Even Pairs in Claw-Free Perfect Graphs.
J. Comb. Theory B
Cláudia Linhares Sales, Frédéric Maffray
1998 J jnl
Graphs whose choice number is equal to their chromatic number.
J. Graph Theory
Sylvain Gravier, Frédéric Maffray
1998 J jnl
On minimal imperfect graphs with circular symmetry.
J. Graph Theory
Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
1997 J jnl
Choice number of 3-colorable elementary graphs.
Discret. Math.
Sylvain Gravier, Frédéric Maffray
1997 J jnl
Coloring perfect degenerate graphs.
Discret. Math.
Hacène Aït Haddadène, Frédéric Maffray
1997 J jnl
On Planar Perfectly Contractile Graphs.
Graphs Comb.
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
1997 J jnl
On the structure of bull-free perfect graphs.
Graphs Comb.
Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto
1997 J jnl
Path parity and perfection.
Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
1996 J jnl
A generalization of simplicial elimination orderings.
J. Graph Theory
Frédéric Maffray, Oscar Porto, Myriam Preissmann
1996 J jnl
Graphs with Largest Number of Minimum Cuts.
Discret. Appl. Math.
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
1996 J jnl
Minimal non-neighborhood-perfect graphs.
J. Graph Theory
András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray
1996 J jnl
On the
J. Comb. Theory B
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
1996 J jnl
On the NP-completeness of the k-colorability problem for triangle-free graphs.
Discret. Math.
Frédéric Maffray, Myriam Preissmann
1995 J jnl
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
J. Comb. Theory B
Frédéric Maffray, Myriam Preissmann
1994 J jnl
Linear Recognition of Pseudo-split Graphs.
Discret. Appl. Math.
Frédéric Maffray, Myriam Preissmann
1994 B conf
On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
WG
Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
1994 J jnl
On the orientation of meyniel graphs.
J. Graph Theory
Mostafa Blidia, Pierre Duchet, Frédéric Maffray
1994 J jnl
Perfect graphs with no
Graphs Comb.
Frédéric Maffray, Myriam Preissmann
1993 J jnl
Antitwins in partitionable graphs.
Discret. Math.
Frédéric Maffray
1993 J jnl
On kernels in perfect graphs.
Comb.
Mostafa Blidia, Pierre Duchet, Frédéric Maffray
1993 J jnl
On the SPANNING
Discret. Appl. Math.
Leizhen Cai, Frédéric Maffray
1993 J jnl
Preperfect graphs.
Comb.
Peter L. Hammer, Frédéric Maffray
1992 J jnl
A charming class of perfectly orderable graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
1992 J jnl
Kernels in perfect line-graphs.
J. Comb. Theory B
Frédéric Maffray
1992 J jnl
On slim graphs, even pairs, and star-cutsets.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray
1991 J jnl
Cut-threshold graphs.
Discret. Appl. Math.
Peter L. Hammer, Frédéric Maffray, Maurice Queyranne
1991 J jnl
New properties of perfectly orderable graphs and strongly perfect graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
1990 J jnl
Completely separable graphs.
Discret. Appl. Math.
Peter L. Hammer, Frédéric Maffray
1990 J jnl
More characterizations of triangulated graphs.
J. Graph Theory
Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray
1990 J jnl
Optimizing weakly triangulated graphs.
Graphs Comb.
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
1989 J jnl
Opposition graphs are strict quasi-parity graphs.
Graphs Comb.
Chính T. Hoàng, Frédéric Maffray
1989 J jnl
Optimizing weakly triangulated graphs.
Graphs Comb.
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
1987 J jnl
On a relationship between Hadwiger and stability numbers.
Discret. Math.
Frédéric Maffray, Henry Meyniel
1986 J jnl
On kernels in i-triangulated graphs.
Discret. Math.
Frédéric Maffray