Even polyhedral decompositions of cubic graphs. - Myriam Preissmann (Discret. Math., 1980)

Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges). - Myriam Preissmann (1981)

Snarks of order 18. - Myriam Preissmann (Discret. Math., 1982)

A class of strongly perfect graphs. - Myriam Preissmann (Discret. Math., 1985)

A note on strong perfectness of graphs. - Myriam Preissmann; Dominique de Werra (Math. Program., 1985)

A note on superbrittle graphs. - Myriam Preissmann; Dominique de Werra; Nadimpalli V. R. Mahadev (Discret. Math., 1986)

Locally perfect graphs. - Myriam Preissmann (J. Comb. Theory B, 1990)

New properties of perfectly orderable graphs and strongly perfect graphs. - Chính T. Hoàng; Frédéric Maffray; Myriam Preissmann (Discret. Math., 1991)

A charming class of perfectly orderable graphs. - Chính T. Hoàng; Frédéric Maffray; Stephan Olariu; Myriam Preissmann (Discret. Math., 1992)

Linear Recognition of Pseudo-split Graphs. - Frédéric Maffray; Myriam Preissmann (Discret. Appl. Math., 1994)

Perfect graphs with no P 5 and no K 5. - Frédéric Maffray; Myriam Preissmann (Graphs Comb., 1994)

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture. - Frédéric Maffray; Myriam Preissmann (J. Comb. Theory B, 1995)

Graphs with Largest Number of Minimum Cuts. - Jenö Lehel; Frédéric Maffray; Myriam Preissmann (Discret. Appl. Math., 1996)

On the NP-completeness of the k-colorability problem for triangle-free graphs. - Frédéric Maffray; Myriam Preissmann (Discret. Math., 1996)

A generalization of simplicial elimination orderings. - Frédéric Maffray; Oscar Porto; Myriam Preissmann (J. Graph Theory, 1996)

On minimal imperfect graphs with circular symmetry. - Gábor Bacsó; Endre Boros; Vladimir Gurvich; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 1998)

Sequential Colorings and Perfect Graphs. - Frédéric Maffray; Myriam Preissmann (Discret. Appl. Math., 1999)

Imperfect and Nonideal Clutters: A Common Approach. - Grigor Gasparyan; Myriam Preissmann; András Sebö (Comb., 2003)

Coloring the Maximal Cliques of Graphs. - Gábor Bacsó; Sylvain Gravier; András Gyárfás; Myriam Preissmann; András Sebö (SIAM J. Discret. Math., 2004)

Graphic Submodular Function Minimization: A Graphic Approach and Applications. - Myriam Preissmann; András Sebö (Bonn Workshop of Combinatorial Optimization, 2008)

Maximum directed cuts in digraphs with degree restriction. - Jenö Lehel; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 2009)

Characterizing path graphs by forbidden induced subgraphs. - Benjamin Lévêque; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 2009)

Snarks with Total Chromatic Number 5. - Gunnar Brinkmann; Simone Dantas; Celina M. H. de Figueiredo; Myriam Preissmann; Diana Sasaki (CTW, 2012)

Generic algorithms for some decision problems on fasciagraphs and rotagraphs. - Marwane Bouznif; Julien Moncel; Myriam Preissmann (Discret. Math., 2012)

On total coloring and equitable total coloring of cubic graphs with large girth. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (CTW, 2013)

The hunting of a snark with total chromatic number 5. - Diana Sasaki; Simone Dantas; Celina M. H. de Figueiredo; Myriam Preissmann (Discret. Appl. Math., 2014)

Snarks with total chromatic number 5. - Gunnar Brinkmann; Myriam Preissmann; Diana Sasaki (Discret. Math. Theor. Comput. Sci., 2015)

Minimum-Density Identifying Codes in Square Grids. - Marwane Bouznif; Frédéric Havet; Myriam Preissmann (AAIM, 2016)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. - Marwane Bouznif; Julien Moncel; Myriam Preissmann (Discret. Appl. Math., 2016)

On the equitable total chromatic number of cubic graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Appl. Math., 2016)

On the total coloring of generalized Petersen graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Math., 2016)

On more variants of the Majority Problem. - Paul-Elliot Anglès d'Auriac; Francis Maisonneuve; Vivien Maisonneuve; Emmanuel Preissmann; Myriam Preissmann (Discret. Appl. Math., 2019)

Exact values for three domination-like problems in circular and infinite grid graphs of small height. - Marwane Bouznif; Julien Darlay; Julien Moncel; Myriam Preissmann (Discret. Math. Theor. Comput. Sci., 2019)

On the Complexity of Colouring Antiprismatic Graphs. - Myriam Preissmann; Cléophée Robin; Nicolas Trotignon (Algorithmica, 2021)

New results on Type 2 snarks. - Simone Dantas; Rodrigo Marinho; Myriam Preissmann; Diana Sasaki (Discuss. Math. Graph Theory, 2023)

Results about the total chromatic number and the conformability of some families of circulant graphs. - Luérbio Faria; Mauro Nigro; Myriam Preissmann; Diana Sasaki (Discret. Appl. Math., 2023)

Graphs with all holes the same length. - Linda Cook; Jake Horsfield; Myriam Preissmann; Cléophée Robin; Paul D. Seymour; Ni Luh Dewi Sintiari; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2024)