Myriam Preissmann

41 papers C 3Journal 36Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Graphs with all holes the same length.
J. Comb. Theory B
Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic
2023 J jnl
New results on Type 2 snarks.
Discuss. Math. Graph Theory
Simone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki
2023 J jnl
Results about the total chromatic number and the conformability of some families of circulant graphs.
Discret. Appl. Math.
Luérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki
2021 J jnl
On the Complexity of Colouring Antiprismatic Graphs.
Algorithmica
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
2019 J jnl
Exact values for three domination-like problems in circular and infinite grid graphs of small height.
Discret. Math. Theor. Comput. Sci.
Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann
2019 J jnl
On more variants of the Majority Problem.
Discret. Appl. Math.
Paul-Elliot Anglès d'Auriac, Francis Maisonneuve, Vivien Maisonneuve, Emmanuel Preissmann, Myriam Preissmann
2019 J jnl
On the complexity of colouring antiprismatic graphs.
CoRR
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
2017 J jnl
Exact values for three domination-like problems in circular and infinite grid graphs of small height.
CoRR
Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann
2016 J jnl
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs.
Discret. Appl. Math.
Marwane Bouznif, Julien Moncel, Myriam Preissmann
2016 C conf
Minimum-Density Identifying Codes in Square Grids.
AAIM
Marwane Bouznif, Frédéric Havet, Myriam Preissmann
2016 J jnl
On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2016 J jnl
On the total coloring of generalized Petersen graphs.
Discret. Math.
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2015 J jnl
Snarks with total chromatic number 5.
Discret. Math. Theor. Comput. Sci.
Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki
2014 J jnl
The hunting of a snark with total chromatic number 5.
Discret. Appl. Math.
Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann
2013 C conf
On total coloring and equitable total coloring of cubic graphs with large girth.
CTW
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2012 J jnl
Generic algorithms for some decision problems on fasciagraphs and rotagraphs.
Discret. Math.
Marwane Bouznif, Julien Moncel, Myriam Preissmann
2012 C conf
Snarks with Total Chromatic Number 5.
CTW
Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
2009 J jnl
Characterizing path graphs by forbidden induced subgraphs.
J. Graph Theory
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2009 J jnl
Maximum directed cuts in digraphs with degree restriction.
J. Graph Theory
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2008 J jnl
Characterizing path graphs by forbidden induced subgraphs
CoRR
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2008 — conf
Graphic Submodular Function Minimization: A Graphic Approach and Applications.
Bonn Workshop of Combinatorial Optimization
Myriam Preissmann, András Sebö
2007 J jnl
Maximum directed cuts in digraphs with degree restriction
CoRR
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2004 J jnl
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math.
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
2003 J jnl
Imperfect and Nonideal Clutters: A Common Approach.
Comb.
Grigor Gasparyan, Myriam Preissmann, András Sebö
1999 J jnl
Sequential Colorings and Perfect Graphs.
Discret. Appl. Math.
Frédéric Maffray, Myriam Preissmann
1998 J jnl
On minimal imperfect graphs with circular symmetry.
J. Graph Theory
Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
1996 J jnl
A generalization of simplicial elimination orderings.
J. Graph Theory
Frédéric Maffray, Oscar Porto, Myriam Preissmann
1996 J jnl
Graphs with Largest Number of Minimum Cuts.
Discret. Appl. Math.
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
1996 J jnl
On the NP-completeness of the k-colorability problem for triangle-free graphs.
Discret. Math.
Frédéric Maffray, Myriam Preissmann
1995 J jnl
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
J. Comb. Theory B
Frédéric Maffray, Myriam Preissmann
1994 J jnl
Linear Recognition of Pseudo-split Graphs.
Discret. Appl. Math.
Frédéric Maffray, Myriam Preissmann
1994 J jnl
Perfect graphs with no
Graphs Comb.
Frédéric Maffray, Myriam Preissmann
1992 J jnl
A charming class of perfectly orderable graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
1991 J jnl
New properties of perfectly orderable graphs and strongly perfect graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
1990 J jnl
Locally perfect graphs.
J. Comb. Theory B
Myriam Preissmann
1986 J jnl
A note on superbrittle graphs.
Discret. Math.
Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
1985 J jnl
A class of strongly perfect graphs.
Discret. Math.
Myriam Preissmann
1985 J jnl
A note on strong perfectness of graphs.
Math. Program.
Myriam Preissmann, Dominique de Werra
1982 J jnl
Snarks of order 18.
Discret. Math.
Myriam Preissmann
1981 — —
Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges).
Myriam Preissmann
1980 J jnl
Even polyhedral decompositions of cubic graphs.
Discret. Math.
Myriam Preissmann