The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frédéric Maffray: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cláudia Linhares Sales, Frédéric Maffray
    On Dart-Free Perfectly Contractile Graphs. Extended Abstract. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:135-144 [Conf]
  2. Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
    On Domination Elimination Orderings and Domination Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:81-92 [Conf]
  3. Mostafa Blidia, Pierre Duchet, Frédéric Maffray
    On kernels in perfect graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:2, pp:231-233 [Journal]
  4. Peter L. Hammer, Frédéric Maffray
    Preperfect graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:2, pp:199-208 [Journal]
  5. Benjamin Lévêque, Frédéric Maffray
    Coloring Meyniel graphs in linear time [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  6. Leizhen Cai, Frédéric Maffray
    On the SPANNING k-Tree Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:139-156 [Journal]
  7. Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:1- [Journal]
  8. Simone Dantas, Sylvain Gravier, Frédéric Maffray
    Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:93-101 [Journal]
  9. Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
    On simplicial and co-simplicial vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:117-132 [Journal]
  10. Jenö Lehel, Frédéric Maffray, Myriam Preissmann
    Graphs with Largest Number of Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:387-407 [Journal]
  11. Frédéric Maffray, Myriam Preissmann
    Linear Recognition of Pseudo-split Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:3, pp:307-312 [Journal]
  12. Frédéric Maffray, Myriam Preissmann
    Sequential Colorings and Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:287-296 [Journal]
  13. Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
    On average lower independence and domination numbers in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:295, n:1-3, pp:1-11 [Journal]
  14. Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
    Coloring the hypergraph of maximal cliques of a graph with no long path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:285-290 [Journal]
  15. Sylvain Gravier, Frédéric Maffray
    On the choice number of claw-free perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:211-218 [Journal]
  16. Sylvain Gravier, Frédéric Maffray, Bojan Mohar
    On a list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:303-308 [Journal]
  17. Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray
    A characterization of P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2461-2472 [Journal]
  18. Mostafa Blidia, Mustapha Chellali, Frédéric Maffray
    Extremal graphs for a new upper bound on domination parameters in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2314-2326 [Journal]
  19. Frédéric Maffray, Dieter Rautenbach
    Small step-dominating sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1212-1215 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:5, pp:719-734 [Journal]
  21. Celina M. Herrera de Figueiredo, Frédéric Maffray, Oscar Porto
    On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:435-456 [Journal]
  22. Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
    Recognizing Planar Strict Quasi-Parity Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:745-757 [Journal]
  23. Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
    On the P4-Structure of Perfect Graphs V. Overlap Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:2, pp:212-237 [Journal]
  24. Frédéric Maffray
    Kernels in perfect line-graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:1-8 [Journal]
  25. Frédéric Maffray, Myriam Preissmann
    Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:294-309 [Journal]
  26. Frédéric Maffray, Bruce A. Reed
    A Description of Claw-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:134-156 [Journal]
  27. Frédéric Maffray, Nicolas Trotignon
    A class of perfectly contractile graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:1-19 [Journal]
  28. Cláudia Linhares Sales, Frédéric Maffray
    Even Pairs in Claw-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:169-191 [Journal]
  29. Celina M. Herrera de Figueiredo, Frédéric Maffray
    Optimizing Bull-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:2, pp:226-240 [Journal]
  30. Frédéric Maffray, Nicolas Trotignon
    Algorithms for Perfectly Contractile Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:553-574 [Journal]
  31. Cláudia Linhares Sales, Frédéric Maffray
    On dart-free perfectly contractile graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:171-194 [Journal]
  32. Benjamin Lévêque, Frédéric Maffray, Bruce Reed, Nicolas Trotignon
    Coloring Artemis graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  33. Frédéric Maffray
    On kernels in i-triangulated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:247-251 [Journal]
  34. Frédéric Maffray, Henry Meyniel
    On a relationship between Hadwiger and stability numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:39-42 [Journal]
  35. Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel
    Some operations preserving the existence of kernels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:211-216 [Journal]
  36. Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray
    An algorithm for coloring some perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:1-16 [Journal]
  37. Frédéric Maffray, Myriam Preissmann
    On the NP-completeness of the k-colorability problem for triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:313-317 [Journal]
  38. Hacène Aït Haddadène, Frédéric Maffray
    Coloring perfect degenerate graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:211-215 [Journal]
  39. Sylvain Gravier, Frédéric Maffray
    Choice number of 3-colorable elementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:353-358 [Journal]
  40. Hazel Everett, Celina M. Herrera de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
    Path parity and perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:233-252 [Journal]
  41. Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
    New properties of perfectly orderable graphs and strongly perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:161-174 [Journal]
  42. Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
    A charming class of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:67-74 [Journal]
  43. Chính T. Hoàng, Frédéric Maffray
    On slim graphs, even pairs, and star-cutsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:93-102 [Journal]
  44. Frédéric Maffray
    Antitwins in partitionable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:275-278 [Journal]

  45. Precoloring co-Meyniel graphs [Citation Graph (, )][DBLP]


  46. Coloring vertices of a graph or finding a Meyniel obstruction [Citation Graph (, )][DBLP]


  47. Maximum directed cuts in digraphs with degree restriction [Citation Graph (, )][DBLP]


  48. On b-perfect chordal graphs [Citation Graph (, )][DBLP]


  49. Characterizing path graphs by forbidden induced subgraphs [Citation Graph (, )][DBLP]


  50. A characterization of b-perfect graphs [Citation Graph (, )][DBLP]


  51. Cut-threshold graphs. [Citation Graph (, )][DBLP]


  52. Completely separable graphs. [Citation Graph (, )][DBLP]


  53. On b-colorings in regular graphs. [Citation Graph (, )][DBLP]


  54. Detecting induced subgraphs. [Citation Graph (, )][DBLP]


  55. Foreword. [Citation Graph (, )][DBLP]


  56. On minimally b-imperfect graphs. [Citation Graph (, )][DBLP]


  57. Extremal perfect graphs for a bound on the domination number. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002