E-LIB Suche - Ergebnisse für: Preissmann, Myriam

1

Graphs with all holes the same length:

Cook, Linda ; Horsfield, Jake ; Preissmann, Myriam...
Journal of Combinatorial Theory, Series B. 168 (2024) - p. 96-158 , 2024

Link: https://doi.org/10.1016/..

2

Results about the total chromatic number and the conformabi..:

Faria, Luerbio ; Nigro, Mauro ; Preissmann, Myriam.
Discrete Applied Mathematics. 340 (2023) - p. 123-133 , 2023

Link: https://doi.org/10.1016/..

3

On the Complexity of Colouring Antiprismatic Graphs:

Preissmann, Myriam ; Robin, Cléophée ; Trotignon, Nicolas
Algorithmica. 83 (2020) 2 - p. 589-612 , 2020

Link: https://doi.org/10.1007/..

4

On more variants of the Majority Problem:

Anglès d'Auriac, Paul-Elliot ; Maisonneuve, Francis ; Maisonneuve, Vivien..
Discrete Applied Mathematics. 265 (2019) - p. 1-12 , 2019

Link: https://doi.org/10.1016/..

5

Generic algorithms for some decision problems on fasciagrap..:

Bouznif, Marwane ; Moncel, Julien ; Preissmann, Myriam
Discrete Mathematics. 312 (2012) 17 - p. 2707-2719 , 2012

Link: https://doi.org/10.1016/..

6

Maximum directed cuts in digraphs with degree restriction:

Lehel, Jenö ; Maffray, Frédéric ; Preissmann, Myriam
Journal of Graph Theory. 61 (2009) 2 - p. 140-156 , 2009

Link: https://doi.org/10.1002/..

7

Characterizing path graphs by forbidden induced subgraphs:

Lévêque, Benjamin ; Maffray, Frédéric ; Preissmann, Myriam
Journal of Graph Theory. 62 (2009) 4 - p. 369-384 , 2009

Link: https://doi.org/10.1002/..

8

Coloring the Maximal Cliques of Graphs:

Bacsó, Gábor ; Gravier, Sylvain ; Gyárfás, András..
SIAM Journal on Discrete Mathematics. 17 (2004) 3 - p. 361-376 , 2004

Link: https://doi.org/10.1137/..

9

Imperfect and Nonideal Clutters: A Common Approach:

Gasparyan*, Grigor ; Preissmann, Myriam ; Sebo, Andr�s
Combinatorica. 23 (2003) 2 - p. 283-302 , 2003

Link: https://doi.org/10.1007/..

10

Sequential colorings and perfect graphs:

Maffray, Frédéric ; Preissmann, Myriam
Discrete Applied Mathematics. 94 (1999) 1-3 - p. 287-296 , 1999

Link: https://doi.org/10.1016/..

11

On minimal imperfect graphs with circular symmetry:

Bacs�, G�bor ; Boros, Endre ; Gurvich, Vladimir..
Journal of Graph Theory. 29 (1998) 4 - p. 209-225 , 1998

Link: https://doi.org/10.1002/..

12

Graphs with largest number of minimum cuts:

Lehel, Jenő ; Maffray, Frédéric ; Preissmann, Myriam
Discrete Applied Mathematics. 65 (1996) 1-3 - p. 387-407 , 1996

Link: https://doi.org/10.1016/..

13

On the NP-completeness of the k-colorability problem for tr..:

Maffray, Frédéric ; Preissmann, Myriam
Discrete Mathematics. 162 (1996) 1-3 - p. 313-317 , 1996

Link: https://doi.org/10.1016/..

14

Perfect graphs with noP 5 and noK 5:

Maffray, Frédéric ; Preissmann, Myriam
Graphs and Combinatorics. 10 (1994) 2-4 - p. 179-184 , 1994

Link: https://doi.org/10.1007/..

15

Linear recognition of pseudo-split graphs:

Maffray, Frédéric ; Preissmann, Myriam
Discrete Applied Mathematics. 52 (1994) 3 - p. 307-312 , 1994

Link: https://doi.org/10.1016/..