default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMyriam Preissmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Linda Cook, Jake Horsfield
, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic:
Graphs with all holes the same length. J. Comb. Theory B 168: 96-158 (2024)- 2023
- [j31]Luérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki:
Results about the total chromatic number and the conformability of some families of circulant graphs. Discret. Appl. Math. 340: 123-133 (2023) - [j30]Simone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki:
New results on Type 2 snarks. Discuss. Math. Graph Theory 43(4): 879-893 (2023) - 2021
- [j29]Myriam Preissmann, Cléophée Robin, Nicolas Trotignon:
On the Complexity of Colouring Antiprismatic Graphs. Algorithmica 83(2): 589-612 (2021)
2010 – 2019
- 2019
- [j28]Paul-Elliot Anglès d'Auriac, Francis Maisonneuve, Vivien Maisonneuve, Emmanuel Preissmann, Myriam Preissmann:
On more variants of the Majority Problem. Discret. Appl. Math. 265: 1-12 (2019) - [j27]Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann:
Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [i5]Myriam Preissmann, Cléophée Robin, Nicolas Trotignon:
On the complexity of colouring antiprismatic graphs. CoRR abs/1910.11001 (2019) - 2017
- [i4]Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann:
Exact values for three domination-like problems in circular and infinite grid graphs of small height. CoRR abs/1708.00758 (2017) - 2016
- [j26]Marwane Bouznif, Julien Moncel, Myriam Preissmann:
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. Discret. Appl. Math. 208: 27-40 (2016) - [j25]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the equitable total chromatic number of cubic graphs. Discret. Appl. Math. 209: 84-91 (2016) - [j24]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the total coloring of generalized Petersen graphs. Discret. Math. 339(5): 1471-1475 (2016) - [c3]Marwane Bouznif, Frédéric Havet, Myriam Preissmann:
Minimum-Density Identifying Codes in Square Grids. AAIM 2016: 77-88 - 2015
- [j23]Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki:
Snarks with total chromatic number 5. Discret. Math. Theor. Comput. Sci. 17(1): 369-382 (2015) - 2014
- [j22]Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann:
The hunting of a snark with total chromatic number 5. Discret. Appl. Math. 164: 470-481 (2014) - 2013
- [i3]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On total coloring and equitable total coloring of cubic graphs with large girth. CTW 2013: 79-83 - 2012
- [j21]Marwane Bouznif, Julien Moncel, Myriam Preissmann:
Generic algorithms for some decision problems on fasciagraphs and rotagraphs. Discret. Math. 312(17): 2707-2719 (2012) - [c2]Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki:
Snarks with Total Chromatic Number 5. CTW 2012: 40-43
2000 – 2009
- 2009
- [j20]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. J. Graph Theory 61(2): 140-156 (2009) - [j19]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory 62(4): 369-384 (2009) - 2008
- [c1]Myriam Preissmann, András Sebö:
Graphic Submodular Function Minimization: A Graphic Approach and Applications. Bonn Workshop of Combinatorial Optimization 2008: 365-385 - [i2]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. CoRR abs/0803.0956 (2008) - 2007
- [i1]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. CoRR abs/0711.3958 (2007) - 2004
- [j18]Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö:
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17(3): 361-376 (2004) - 2003
- [j17]Grigor Gasparyan, Myriam Preissmann, András Sebö:
Imperfect and Nonideal Clutters: A Common Approach. Comb. 23(2): 283-302 (2003)
1990 – 1999
- 1999
- [j16]Frédéric Maffray, Myriam Preissmann:
Sequential Colorings and Perfect Graphs. Discret. Appl. Math. 94(1-3): 287-296 (1999) - 1998
- [j15]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. J. Graph Theory 29(4): 209-225 (1998) - 1996
- [j14]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. 65(1-3): 387-407 (1996) - [j13]Frédéric Maffray, Myriam Preissmann:
On the NP-completeness of the k-colorability problem for triangle-free graphs. Discret. Math. 162(1-3): 313-317 (1996) - [j12]Frédéric Maffray, Oscar Porto, Myriam Preissmann:
A generalization of simplicial elimination orderings. J. Graph Theory 23(2): 203-208 (1996) - 1995
- [j11]Frédéric Maffray, Myriam Preissmann:
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture. J. Comb. Theory B 63(2): 294-309 (1995) - 1994
- [j10]Frédéric Maffray, Myriam Preissmann:
Linear Recognition of Pseudo-split Graphs. Discret. Appl. Math. 52(3): 307-312 (1994) - [j9]Frédéric Maffray, Myriam Preissmann:
Perfect graphs with no P 5 and no K 5. Graphs Comb. 10(2-4): 179-184 (1994) - 1992
- [j8]Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann:
A charming class of perfectly orderable graphs. Discret. Math. 102(1): 67-74 (1992) - 1991
- [j7]Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann:
New properties of perfectly orderable graphs and strongly perfect graphs. Discret. Math. 98(3): 161-174 (1991) - 1990
- [j6]Myriam Preissmann:
Locally perfect graphs. J. Comb. Theory B 50(1): 22-40 (1990)
1980 – 1989
- 1986
- [j5]Myriam Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev:
A note on superbrittle graphs. Discret. Math. 61(2-3): 259-267 (1986) - 1985
- [j4]Myriam Preissmann:
A class of strongly perfect graphs. Discret. Math. 54(1): 117-120 (1985) - [j3]Myriam Preissmann, Dominique de Werra:
A note on strong perfectness of graphs. Math. Program. 31(3): 321-326 (1985) - 1982
- [j2]Myriam Preissmann:
Snarks of order 18. Discret. Math. 42(1): 125-126 (1982) - 1981
- [b1]Myriam Preissmann:
Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges). Joseph Fourier University, Grenoble, France, 1981 - 1980
- [j1]Myriam Preissmann:
Even polyhedral decompositions of cubic graphs. Discret. Math. 32(3): 331-334 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
