Frédéric Maffray

According to our database1, Frédéric Maffray authored at least 136 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Coloring graphs with no induced five-vertex path or gem.
J. Graph Theory, 2020

2019
Square-Free Graphs with No Six-Vertex Induced Path.
SIAM J. Discret. Math., 2019

Coloring square-free Berge graphs.
J. Comb. Theory, Ser. B, 2019

Polynomial Cases for the Vertex Coloring Problem.
Algorithmica, 2019

2018
Coloring (gem, co-gem)-free graphs.
J. Graph Theory, 2018

χ-bounded families of oriented graphs.
J. Graph Theory, 2018

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, 2018

Even pairs and prism corners in square-free Berge graphs.
J. Comb. Theory, Ser. B, 2018

On some graphs with a unique perfect matching.
Inf. Process. Lett., 2018

Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs.
Discret. Math., 2018

Decomposition techniques applied to the Clique-Stable set separation problem.
Discret. Math., 2018

A coloring algorithm for -free line graphs.
Discret. Appl. Math., 2018

2017
Graphs with No Induced Five-Vertex Path or Antipath.
J. Graph Theory, 2017

Long induced paths in graphs.
Eur. J. Comb., 2017

4-coloring (P6, bull)-free graphs.
Discret. Appl. Math., 2017

Maximum weight independent sets in classes related to claw-free graphs.
Discret. Appl. Math., 2017

On color-critical (P<sub>5</sub>, co-P<sub>5</sub>)-free graphs.
Discret. Appl. Math., 2017

Coloring ($P_5$, bull)-free graphs.
CoRR, 2017

Small Feedback Vertex Sets in Planar Digraphs.
Electron. J. Comb., 2017

2016
Vizing Bound for the Chromatic Number on Some Graph Classes.
Graphs Comb., 2016

On the Choosability of Claw-Free Perfect Graphs.
Graphs Comb., 2016

Weighted independent sets in classes of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2016

Maximum Weight Stable Set in ($P_7$, bull)-free graphs.
CoRR, 2016

The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs.
CoRR, 2016

The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Even pairs in square-free Berge graphs.
Electron. Notes Discret. Math., 2015

Equitable partition of graphs into induced forests.
Discret. Math., 2015

Domination, coloring and stability in P5-reducible graphs.
Discret. Appl. Math., 2015

On edge-b-critical graphs.
Discret. Appl. Math., 2015

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.
Discret. Appl. Math., 2015

Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds.
Discret. Appl. Math., 2015

Graphs with no induced wheel or antiwheel.
CoRR, 2015

2014
Fast recognition of doubled graphs.
Theor. Comput. Sci., 2014

List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs Comb., 2014

2013
Fire Containment in Planar Graphs.
J. Graph Theory, 2013

The chromatic number of {<i>P</i><sub>5</sub>, <i>K</i><sub>4</sub>}-free graphs.
Discret. Math., 2013

b-colouring the Cartesian product of trees and some other graphs.
Discret. Appl. Math., 2013

Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.
CoRR, 2013

ERRATUM to: Double domination edge removal critical graphs.
Australas. J Comb., 2013

2012
Coloring vertices of a graph or finding a Meyniel obstruction.
Theor. Comput. Sci., 2012

On 3-Colorable P<sub>5</sub>-Free Graphs.
SIAM J. Discret. Math., 2012

A Characterization of b-Perfect Graphs.
J. Graph Theory, 2012

New Bounds on the Grundy Number of Products of Graphs.
J. Graph Theory, 2012

On graphs with no induced subdivision of K<sub>4</sub>.
J. Comb. Theory, Ser. B, 2012

Dominator Colorings in Some Classes of Graphs.
Graphs Comb., 2012

b-colouring outerplanar graphs with large girth.
Discret. Math., 2012

A characterization of claw-free b-perfect graphs.
Discret. Math., 2012

2k<sub>2</sub>-partition of some classes of graphs.
Discret. Appl. Math., 2012

Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences.
Discret. Appl. Math., 2012

b-coloring of some bipartite graphs.
Australas. J Comb., 2012

2011
Transitive orientations in bull-reducible Berge graphs.
Discret. Appl. Math., 2011

A characterization of chain probe graphs.
Ann. Oper. Res., 2011

The chain graph sandwich problem.
Ann. Oper. Res., 2011

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011

2010
Connected domination dot-critical graphs.
Contributions Discret. Math., 2010

Double domination edge removal critical graphs.
Australas. J Comb., 2010

2009
Coloring Artemis graphs.
Theor. Comput. Sci., 2009

Characterizing path graphs by forbidden induced subgraphs.
J. Graph Theory, 2009

Maximum directed cuts in digraphs with degree restriction.
J. Graph Theory, 2009

Stable sets in k-colorable P<sub>5</sub>-free graphs.
Inf. Process. Lett., 2009

On b-perfect Chordal Graphs.
Graphs Comb., 2009

On the b-Coloring of Cographs and <i>P</i><sub>4</sub>-Sparse Graphs.
Graphs Comb., 2009

b-chromatic number of cacti.
Electron. Notes Discret. Math., 2009

On minimally b-imperfect graphs.
Discret. Appl. Math., 2009

Foreword.
Discret. Appl. Math., 2009

On b-colorings in regular graphs.
Discret. Appl. Math., 2009

2008
On Planar Quasi-Parity Graphs.
SIAM J. Discret. Math., 2008

Algorithms for Square-3PC(., .)-Free Berge Graphs.
SIAM J. Discret. Math., 2008

Coloring Bull-Free Perfectly Contractile Graphs.
SIAM J. Discret. Math., 2008

Extremal perfect graphs for a bound on the domination number.
Discret. Math., 2008

2007
Precoloring Extension of Co-Meyniel Graphs.
Graphs Comb., 2007

Detecting induced subgraphs.
Electron. Notes Discret. Math., 2007

Small step-dominating sets in trees.
Discret. Math., 2007

Locating-domination and identifying codes in trees.
Australas. J Comb., 2007

2006
A class of perfectly contractile graphs.
J. Comb. Theory, Ser. B, 2006

A characterization of P<sub>4</sub>-comparability graphs.
Discret. Math., 2006

Extremal graphs for a new upper bound on domination parameters in graphs.
Discret. Math., 2006

2005
Algorithms for Perfectly Contractile Graphs.
SIAM J. Discret. Math., 2005

Algorithms for 3PC(., .)-free Berge graphs.
Electron. Notes Discret. Math., 2005

Coloring Meyniel graphs in linear time.
Electron. Notes Discret. Math., 2005

Exact double domination in graphs.
Discuss. Math. Graph Theory, 2005

On average lower independence and domination numbers in graphs.
Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction
CoRR, 2005

Precoloring co-Meyniel graphs
CoRR, 2005

2004
On dart-free perfectly contractile graphs.
Theor. Comput. Sci., 2004

Optimizing Bull-Free Perfect Graphs.
SIAM J. Discret. Math., 2004

Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.
Eur. J. Comb., 2004

On the choice number of claw-free perfect graphs.
Discret. Math., 2004

On simplicial and co-simplicial vertices in graphs.
Discret. Appl. Math., 2004

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Discret. Appl. Math., 2004

2003
On a list-coloring problem.
Discret. Math., 2003

Coloring the hypergraph of maximal cliques of a graph with no long path.
Discret. Math., 2003

2001
Recognizing Planar Strict Quasi-Parity Graphs.
Graphs Comb., 2001

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.
Graphs Comb., 2001

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electron. Notes Discret. Math., 2001

2000
On Dart-Free Perfectly Contractile Graphs. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
A characterization of <i>P</i><sub>4</sub>-indifference graphs.
J. Graph Theory, 1999

A Description of Claw-Free Perfect Graphs.
J. Comb. Theory, Ser. B, 1999

Some operations preserving the existence of kernels.
Discret. Math., 1999

Sequential Colorings and Perfect Graphs.
Discret. Appl. Math., 1999

Preface.
Discret. Appl. Math., 1999

1998
Graphs whose choice number is equal to their chromatic number.
J. Graph Theory, 1998

On minimal imperfect graphs with circular symmetry.
J. Graph Theory, 1998

Even Pairs in Claw-Free Perfect Graphs.
J. Comb. Theory, Ser. B, 1998

An algorithm for coloring some perfect graphs.
Discret. Math., 1998

1997
On Planar Perfectly Contractile Graphs.
Graphs Comb., 1997

On the structure of bull-free perfect graphs.
Graphs Comb., 1997

Coloring perfect degenerate graphs.
Discret. Math., 1997

Choice number of 3-colorable elementary graphs.
Discret. Math., 1997

Path parity and perfection.
Discret. Math., 1997

1996
A generalization of simplicial elimination orderings.
J. Graph Theory, 1996

Minimal non-neighborhood-perfect graphs.
J. Graph Theory, 1996

On the <i>P</i><sub>4</sub>-Structure of Perfect Graphs V. Overlap Graphs.
J. Comb. Theory, Ser. B, 1996

On the NP-completeness of the k-colorability problem for triangle-free graphs.
Discret. Math., 1996

Graphs with Largest Number of Minimum Cuts.
Discret. Appl. Math., 1996

1995
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
J. Comb. Theory, Ser. B, 1995

1994
On the orientation of meyniel graphs.
J. Graph Theory, 1994

Perfect graphs with no <i>P</i> <sub>5</sub> and no <i>K</i> <sub>5</sub>.
Graphs Comb., 1994

Linear Recognition of Pseudo-split Graphs.
Discret. Appl. Math., 1994

On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993
Antitwins in partitionable graphs.
Discret. Math., 1993

On the SPANNING <i>k</i>-Tree Problem.
Discret. Appl. Math., 1993

Preperfect graphs.
Comb., 1993

On kernels in perfect graphs.
Comb., 1993

1992
Kernels in perfect line-graphs.
J. Comb. Theory, Ser. B, 1992

A charming class of perfectly orderable graphs.
Discret. Math., 1992

On slim graphs, even pairs, and star-cutsets.
Discret. Math., 1992

1991
New properties of perfectly orderable graphs and strongly perfect graphs.
Discret. Math., 1991

Cut-threshold graphs.
Discret. Appl. Math., 1991

1990
More characterizations of triangulated graphs.
J. Graph Theory, 1990

Optimizing weakly triangulated graphs.
Graphs Comb., 1990

Completely separable graphs.
Discret. Appl. Math., 1990

1989
Opposition graphs are strict quasi-parity graphs.
Graphs Comb., 1989

1987
On a relationship between Hadwiger and stability numbers.
Discret. Math., 1987

1986
On kernels in i-triangulated graphs.
Discret. Math., 1986


  Loading...