The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Myriam Preissmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Grigor Gasparyan, Myriam Preissmann, András Sebö
    Imperfect and Nonideal Clutters: A Common Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:283-302 [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Myriam Preissmann
    Locally perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:22-40 [Journal]
  7. Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
    Coloring the Maximal Cliques of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:361-376 [Journal]
  8. Myriam Preissmann
    Snarks of order 18. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:125-126 [Journal]
  9. 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]
  10. 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]
  11. 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]

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


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


Search in 0.003secs, Finished in 0.005secs
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