Frédéric Maffray

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
Annals of Operations Research
2024-07-30Paper
On domination elimination orderings and domination graphs
Graph-Theoretic Concepts in Computer Science
2024-01-05Paper
Coloring rings
Journal of Graph Theory
2023-09-29Paper
Coloring rings
Journal of Graph Theory
2023-09-29Paper
Coloring graphs with no induced five‐vertex path or gem
Journal of Graph Theory
2023-08-22Paper
Square-Free Graphs with No Six-Vertex Induced Path
SIAM Journal on Discrete Mathematics
2019-08-29Paper
Polynomial cases for the vertex coloring problem
Algorithmica
2019-03-11Paper
Coloring square-free Berge graphs
Journal of Combinatorial Theory. Series B
2019-02-08Paper
Coloring square-free Berge graphs
Journal of Combinatorial Theory. Series B
2019-02-08Paper
Coloring (gem, co‐gem)‐free graphs
Journal of Graph Theory
2019-01-03Paper
χ‐bounded families of oriented graphs
Journal of Graph Theory
2019-01-03Paper
χ‐bounded families of oriented graphs
Journal of Graph Theory
2019-01-03Paper
On some graphs with a unique perfect matching
Information Processing Letters
2018-10-19Paper
Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs''
Journal of Combinatorial Theory. Series B
2018-10-11Paper
Even pairs and prism corners in square-free Berge graphs
Journal of Combinatorial Theory. Series B
2018-05-09Paper
Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
Discrete Mathematics
2018-04-05Paper
Decomposition techniques applied to the clique-stable set separation problem
Discrete Mathematics
2018-04-05Paper
A coloring algorithm for \(4 K_1\)-free line graphs
Discrete Applied Mathematics
2017-12-20Paper
4-coloring \((P_6, \text{bull})\)-free graphs
Discrete Applied Mathematics
2017-09-12Paper
Coloring ($P_5$, bull)-free graphs2017-07-27Paper
Graphs with no induced wheel and no induced antiwheel
Applicable Analysis and Discrete Mathematics
2017-07-19Paper
Small feedback vertex sets in planar digraphs
The Electronic Journal of Combinatorics
2017-05-18Paper
Small feedback vertex sets in planar digraphs
The Electronic Journal of Combinatorics
2017-05-18Paper
Graphs with No Induced Five‐Vertex Path or Antipath
Journal of Graph Theory
2017-04-21Paper
Long induced paths in graphs
European Journal of Combinatorics
2017-03-28Paper
On the choosability of claw-free perfect graphs
Graphs and Combinatorics
2017-01-13Paper
The maximum weight stable set problem in (P₆, bull)-free graphs
Graph-Theoretic Concepts in Computer Science
2016-12-22Paper
On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
Discrete Applied Mathematics
2016-11-24Paper
Maximum weight independent sets in classes related to claw-free graphs
Discrete Applied Mathematics
2016-11-24Paper
Even pairs in square-free Berge graphs2016-10-14Paper
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
Lecture Notes in Computer Science
2016-09-02Paper
Vizing bound for the chromatic number on some graph classes
Graphs and Combinatorics
2016-07-28Paper
Weighted independent sets in classes of \(P_6\)-free graphs
Discrete Applied Mathematics
2016-06-21Paper
scientific article; zbMATH DE number 6464011 (Why is no real title available?)2015-07-24Paper
Equitable partition of graphs into induced forests
Discrete Mathematics
2015-04-29Paper
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Discrete Applied Mathematics
2015-04-28Paper
Domination, coloring and stability in \(P_5\)-reducible graphs
Discrete Applied Mathematics
2015-04-28Paper
On the b-chromatic number of the Cartesian product of two complete graphs2015-04-08Paper
Even pairs in square-free Berge graphs with no odd prism2015-02-12Paper
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Discrete Applied Mathematics
2015-02-06Paper
On edge-\(b\)-critical graphs
Discrete Applied Mathematics
2014-11-28Paper
List-coloring claw-free graphs with small clique number
Graphs and Combinatorics
2014-09-19Paper
Erratum to: ``Double domination edge removal critical graphs''
The Australasian Journal of Combinatorics
2014-01-03Paper
Fast recognition of doubled graphs
Theoretical Computer Science
2013-12-13Paper
Fire Containment in Planar Graphs
Journal of Graph Theory
2013-07-31Paper
On vertex b-critical trees
Opuscula Mathematica
2013-07-30Paper
\(B\)-chromatic number of cacti
Electronic Notes in Discrete Mathematics
2013-07-19Paper
On 3-colorable P₅-free graphs
SIAM Journal on Discrete Mathematics
2013-04-09Paper
The chromatic number of \(\{P_5,K_4\}\)-free graphs
Discrete Mathematics
2013-03-19Paper
Characterization of \(b\gamma\)-perfect graphs
AKCE International Journal of Graphs and Combinatorics
2013-01-03Paper
New bounds on the Grundy number of products of graphs
Journal of Graph Theory
2012-09-12Paper
A characterization of b-perfect graphs
Journal of Graph Theory
2012-09-12Paper
b-coloring of some bipartite graphs
The Australasian Journal of Combinatorics
2012-09-05Paper
On graphs with no induced subdivision of \(K_4\)
Journal of Combinatorial Theory. Series B
2012-08-14Paper
Coloring vertices of a graph or finding a Meyniel obstruction
Theoretical Computer Science
2012-05-30Paper
\(b\)-colouring outerplanar graphs with large girth
Discrete Mathematics
2012-05-30Paper
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
2012-05-04Paper
Dominator colorings in some classes of graphs
Graphs and Combinatorics
2012-01-24Paper
A characterization of claw-free \(b\)-perfect graphs
Discrete Mathematics
2012-01-11Paper
The chain graph sandwich problem
Annals of Operations Research
2011-11-17Paper
A characterization of chain probe graphs
Annals of Operations Research
2011-11-17Paper
scientific article; zbMATH DE number 5942290 (Why is no real title available?)2011-08-24Paper
Double domination edge removal critical graphs2011-05-31Paper
Transitive orientations in bull-reducible Berge graphs
Discrete Applied Mathematics
2011-04-19Paper
Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
Information Processing Letters
2010-09-02Paper
Detecting induced subgraphs
Discrete Applied Mathematics
2010-04-28Paper
On minimally \(b\)-imperfect graphs
Discrete Applied Mathematics
2010-04-28Paper
Characterizing path graphs by forbidden induced subgraphs
Journal of Graph Theory
2009-12-18Paper
On the b-coloring of cographs and \(P_{4}\)-sparse graphs
Graphs and Combinatorics
2009-12-09Paper
On b-perfect chordal graphs
Graphs and Combinatorics
2009-12-09Paper
On \(b\)-colorings in regular graphs
Discrete Applied Mathematics
2009-06-24Paper
Maximum directed cuts in digraphs with degree restriction
Journal of Graph Theory
2009-06-16Paper
Coloring Artemis graphs
Theoretical Computer Science
2009-05-28Paper
Algorithms for Square-3PC(\cdot, \cdot)-Free Berge Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Algorithms for Square-3PC(\cdot, \cdot)-Free Berge Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
On Planar Quasi-Parity Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Coloring Bull-Free Perfectly Contractile Graphs
SIAM Journal on Discrete Mathematics
2008-12-05Paper
Extremal perfect graphs for a bound on the domination number
Discrete Mathematics
2008-11-12Paper
Detecting induced subgraphs
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Locating-domination and identifying codes in trees2008-02-22Paper
Precoloring extension of co-Meyniel graphs
Graphs and Combinatorics
2007-09-10Paper
Coloring Meyniel graphs in linear time
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Algorithms for 3PC(⋅, ⋅)-free Berge graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Small step-dominating sets in trees
Discrete Mathematics
2007-03-15Paper
Odd pairs of cliques
(available as arXiv preprint)
2007-03-05Paper
scientific article; zbMATH DE number 5130731 (Why is no real title available?)2007-03-05Paper
Extremal graphs for a new upper bound on domination parameters in graphs
Discrete Mathematics
2006-10-30Paper
A characterization of \(P_{4}\)-comparability graphs
Discrete Mathematics
2006-10-30Paper
Exact double domination in graphs
Discussiones Mathematicae Graph Theory
2006-10-16Paper
Algorithms for Perfectly Contractile Graphs
SIAM Journal on Discrete Mathematics
2006-06-01Paper
A class of perfectly contractile graphs
Journal of Combinatorial Theory. Series B
2006-01-10Paper
On average lower independence and domination numbers in graphs
Discrete Mathematics
2005-06-23Paper
Optimizing Bull-Free Perfect Graphs
SIAM Journal on Discrete Mathematics
2005-02-28Paper
On dart-free perfectly contractile graphs
Theoretical Computer Science
2004-11-12Paper
scientific article; zbMATH DE number 2096444 (Why is no real title available?)2004-09-06Paper
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
European Journal of Combinatorics
2004-08-06Paper
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
Discrete Applied Mathematics
2004-08-06Paper
Erratum : MCColor is not optimal on Meyniel graphs
(available as arXiv preprint)
2004-05-17Paper
On simplicial and co-simplicial vertices in graphs.
Discrete Applied Mathematics
2004-03-29Paper
On the choice number of claw-free perfect graphs
Discrete Mathematics
2004-02-14Paper
Coloring the hypergraph of maximal cliques of a graph with no long path
Discrete Mathematics
2003-11-25Paper
scientific article; zbMATH DE number 1944138 (Why is no real title available?)2003-11-05Paper
On a list-coloring problem
Discrete Mathematics
2003-07-29Paper
On the structure of bull-free perfect graphs. II: The weakly chordal case
Graphs and Combinatorics
2003-03-27Paper
Recognizing planar strict quasi-parity graphs
Graphs and Combinatorics
2002-08-08Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Frédéric Maffray