Myriam Preissmann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2023

New results on Type 2 snarksSimone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki. dmgt, 43(4):879-893, 2023. [doi]

Results about the total chromatic number and the conformability of some families of circulant graphsLuérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki. DAM, 340:123-133, December 2023. [doi]

2021

On the Complexity of Colouring Antiprismatic GraphsMyriam Preissmann, Cléophée Robin, Nicolas Trotignon. algorithmica, 83(2):589-612, 2021. [doi]

2019

Exact values for three domination-like problems in circular and infinite grid graphs of small heightMarwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann. dmtcs, 21(3), 2019. [doi]

On more variants of the Majority ProblemPaul-Elliot Anglès d'Auriac, Francis Maisonneuve, Vivien Maisonneuve, Emmanuel Preissmann, Myriam Preissmann. DAM, 265:1-12, 2019. [doi]

2016

2015

Snarks with total chromatic number 5Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki. dmtcs, 17(1):369-382, 2015. [doi]

2014

The hunting of a snark with total chromatic number 5Diana Sasaki, Simone Dantas, Celina M. Herrera de Figueiredo, Myriam Preissmann. DAM, 164:470-481, 2014. [doi]

2012

Generic algorithms for some decision problems on fasciagraphs and rotagraphsMarwane Bouznif, Julien Moncel, Myriam Preissmann. DM, 312(17):2707-2719, 2012. [doi]

2009

Maximum directed cuts in digraphs with degree restrictionJenö Lehel, Frédéric Maffray, Myriam Preissmann. jgt, 61(2):140-156, 2009. [doi]

Characterizing path graphs by forbidden induced subgraphsBenjamin Lévêque, Frédéric Maffray, Myriam Preissmann. jgt, 62(4):369-384, 2009. [doi]

2008

Graphic Submodular Function Minimization: A Graphic Approach and ApplicationsMyriam Preissmann, András Sebö. bonnco 2009: 365-385 [doi]

2004

Coloring the Maximal Cliques of GraphsGábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö. siamdm, 17(3):361-376, 2004. [doi]

2003

Imperfect and Nonideal Clutters: A Common ApproachGrigor Gasparyan, Myriam Preissmann, András Sebö. combinatorica, 23(2):283-302, 2003. [doi]

1999

Sequential Colorings and Perfect GraphsFrédéric Maffray, Myriam Preissmann. DAM, 94(1-3):287-296, 1999. [doi]

1998

On minimal imperfect graphs with circular symmetryGábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann. jgt, 29(4):209-225, 1998. [doi]

1996

Graphs with Largest Number of Minimum CutsJenö Lehel, Frédéric Maffray, Myriam Preissmann. DAM, 65(1-3):387-407, 1996. [doi]

On the NP-completeness of the k-colorability problem for triangle-free graphsFrédéric Maffray, Myriam Preissmann. DM, 162(1-3):313-317, 1996. [doi]

A generalization of simplicial elimination orderingsFrédéric Maffray, Oscar Porto, Myriam Preissmann. jgt, 23(2):203-208, 1996. [doi]

1995

Split-Neighborhood Graphs and the Strong Perfect Graph ConjectureFrédéric Maffray, Myriam Preissmann. JCT, 63(2):294-309, 1995. [doi]

1994

Linear Recognition of Pseudo-split GraphsFrédéric Maffray, Myriam Preissmann. DAM, 52(3):307-312, 1994. [doi]

5Frédéric Maffray, Myriam Preissmann. gc, 10(2-4):179-184, 1994. [doi]

1992

A charming class of perfectly orderable graphsChính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann. DM, 102(1):67-74, 1992. [doi]

1991

New properties of perfectly orderable graphs and strongly perfect graphsChính T. Hoàng, Frédéric Maffray, Myriam Preissmann. DM, 98(3):161-174, 1991. [doi]

1990

Locally perfect graphsMyriam Preissmann. JCT, 50(1):22-40, 1990. [doi]

1985

A note on strong perfectness of graphsMyriam Preissmann, Dominique de Werra. mp, 31(3):321-326, 1985. [doi]

1982

Snarks of order 18Myriam Preissmann. DM, 42(1):125-126, 1982. [doi]

1981

Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges)Myriam Preissmann. PhD thesis, Joseph Fourier University, Grenoble, France, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL