Myriam Preissmann Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs CoRR abs/0803.0956: (2008)
2007
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJenö Lehel, Frédéric Maffray, Myriam Preissmann: Maximum directed cuts in digraphs with degree restriction CoRR abs/0711.3958: (2007)
2004
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö: Coloring the Maximal Cliques of Graphs. SIAM J. Discrete Math. 17(3): 361-376 (2004)
2003
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGrigor Gasparyan, Myriam Preissmann, András Sebö: Imperfect and Nonideal Clutters: A Common Approach. Combinatorica 23(2): 283-302 (2003)
1999
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Maffray, Myriam Preissmann: Sequential Colorings and Perfect Graphs. Discrete Applied Mathematics 94(1-3): 287-296 (1999)
1996
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJenö Lehel, Frédéric Maffray, Myriam Preissmann: Graphs with Largest Number of Minimum Cuts. Discrete Applied Mathematics 65(1-3): 387-407 (1996)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Maffray, Myriam Preissmann: On the NP-completeness of the k-colorability problem for triangle-free graphs. Discrete Mathematics 162(1-3): 313-317 (1996)
1995
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Maffray, Myriam Preissmann: Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture. J. Comb. Theory, Ser. B 63(2): 294-309 (1995)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Maffray, Myriam Preissmann: Linear Recognition of Pseudo-split Graphs. Discrete Applied Mathematics 52(3): 307-312 (1994)
1992
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann: A charming class of perfectly orderable graphs. Discrete Mathematics 102(1): 67-74 (1992)
1991
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChính T. Hoàng, Frédéric Maffray, Myriam Preissmann: New properties of perfectly orderable graphs and strongly perfect graphs. Discrete Mathematics 98(3): 161-174 (1991)
1990
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMyriam Preissmann: Locally perfect graphs. J. Comb. Theory, Ser. B 50(1): 22-40 (1990)
1982
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMyriam Preissmann: Snarks of order 18. Discrete Mathematics 42(1): 125-126 (1982)

Coauthor Index

1Gábor Bacsó [11]
2Grigor Gasparyan [10]
3Sylvain Gravier [11]
4András Gyárfás [11]
5Chính T. Hoàng [3] [4]
6Jenö Lehel (Jeno Lehel) [8] [12]
7Benjamin Lévêque [13]
8Frédéric Maffray [3] [4] [5] [6] [7] [8] [9] [12] [13]
9Stephan Olariu [4]
10András Sebö [10] [11]

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)