Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Myriam Preissmann
Observed names:
M Preissmann,
M. Preissmann,
Preissmann, Myriam
Institution:
Université Grenoble Alpes
Observed institutions:
Institut polytechnique de Grenoble,
Centre National de la Recherche Scientifique,
Université Joseph Fourier,
Laboratoire des Sciences pour la Conception, l'Optimisation et la Production,
École Polytechnique Fédérale de Lausanne,
Université Grenoble Alpes
show all 6
ORCID:
0000-0002-3484-6755
Observed ORCID:
0000-0002-3484-6755
OpenAlex ID:
A5034533216
On the NP-completeness of the k-colorability problem for triangle-free graphs
1996
·
Frédéric Maffray
, Myriam Preissmann
·
Discrete Mathematics
·
141
PDF
Coloring the Maximal Cliques of Graphs
2004
·
Gábor Bacsó
, Sylvain Gravier
, et al.
·
SIAM Journal on Discrete Mathematics
·
86
The random field Ising model : algorithmic complexity and phase transition
1985
·
J.C. Angles d'Auriac
, M. Preissmann
, et al.
·
Journal de Physique Lettres
·
81
Linear recognition of pseudo-split graphs
1994
·
Frédéric Maffray
, Myriam Preissmann
·
Discrete Applied Mathematics
·
51
Sur les colorations des arêtes des graphes cubiques
1981
·
Preissmann, Myriam
·
HAL
·
42
Snarks with total chromatic number 5
2015
·
Gunnar Brinkmann
, Myriam Preissmann
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
31
PDF
Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
2002
·
J-Ch Angl s d Auriac
, F Igl i
, et al.
·
Journal of Physics A Mathematical and General
·
30
PDF
Optimal cuts in graphs and statistical mechanics
1997
·
J.C.Anglès d'Auriac
, M. Preissmann
, et al.
·
Mathematical and Computer Modelling
·
27
PDF
Characterizing path graphs by forbidden induced subgraphs
2009
·
Benjamin Lévêque
, Frédéric Maffray
, et al.
·
Journal of Graph Theory
·
26
PDF
The hunting of a snark with total chromatic number 5
2013
·
D. Sasaki
, S. Dantas
, et al.
·
Discrete Applied Mathematics
·
25
PDF
On the equitable total chromatic number of cubic graphs
2015
·
S. Dantas
, C.M.H. de Figueiredo
, et al.
·
Discrete Applied Mathematics
·
22
PDF
A note on superbrittle graphs
1986
·
M Preissmann
, D de Werra
, et al.
·
Discrete Mathematics
·
21
On the total coloring of generalized Petersen graphs
2016
·
S. Dantas
, C.M.H. de Figueiredo
, et al.
·
Discrete Mathematics
·
19
PDF
On minimal imperfect graphs with circular symmetry
1998
·
G�bor Bacs�
, Endre Boros
, et al.
·
Journal of Graph Theory
·
19
Graphs with all holes the same length
2024
·
Linda Cook
, Jake Horsfield
, et al.
·
Journal of Combinatorial Theory Series B
·
16
PDF
Minimum-Density Identifying Codes in Square Grids
2016
·
Marwane Bouznif
, Frédéric Havet
, et al.
·
Lecture notes in computer science
·
12
Maximum directed cuts in digraphs with degree restriction
2009
·
Jenö Lehel
, Frédéric Maffray
, et al.
·
Journal of Graph Theory
·
12
Locally perfect graphs
1990
·
Myriam Preissmann
·
Journal of Combinatorial Theory Series B
·
12
PDF
Snarks of order 18
1982
·
Myriam Preissmann
·
Discrete Mathematics
·
12
Generic algorithms for some decision problems on fasciagraphs and rotagraphs
2012
·
Marwane Bouznif
, Julien Moncel
, et al.
·
Discrete Mathematics
·
10
PDF
Imperfect and Nonideal Clutters: A Common Approach
2003
·
Grigor Gasparyan*
, Myriam Preissmann
, et al.
·
COMBINATORICA
·
10
Graphs with largest number of minimum cuts
1996
·
Jenő Lehel
, Frédéric Maffray
, et al.
·
Discrete Applied Mathematics
·
10
A charming class of perfectly orderable graphs
1992
·
Chính T. Hoàng
, Frédéric Maffray
, et al.
·
Discrete Mathematics
·
10
Results about the total chromatic number and the conformability of some families of circulant graphs
2023
·
Luerbio Faria
, Mauro Nigro
, et al.
·
Discrete Applied Mathematics
·
9
C-Minimal Snarks
1983
·
Myriam Preissmann
·
North-Holland mathematics studies
·
8
Show more works
View as search
Works count:
64
Citation count:
814
H-index:
15
I10-index:
23
Year
Topic
Type