|
Search the dblp DataBase
Myriam Preissmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- Myriam Preissmann
Locally perfect graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:22-40 [Journal]
- 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]
- Myriam Preissmann
Snarks of order 18. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:42, n:1, pp:125-126 [Journal]
- 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]
- 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]
- 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]
Maximum directed cuts in digraphs with degree restriction [Citation Graph (, )][DBLP]
Characterizing path graphs by forbidden induced subgraphs [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|