Myriam Preissmann

Orcid: 0000-0002-3484-6755

According to our database1, Myriam Preissmann authored at least 36 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Results about the total chromatic number and the conformability of some families of circulant graphs.
Discret. Appl. Math., December, 2023

New results on Type 2 snarks.
Discuss. Math. Graph Theory, 2023

2021
On the Complexity of Colouring Antiprismatic Graphs.
Algorithmica, 2021

2019
Exact values for three domination-like problems in circular and infinite grid graphs of small height.
Discret. Math. Theor. Comput. Sci., 2019

On more variants of the Majority Problem.
Discret. Appl. Math., 2019

2016
On the total coloring of generalized Petersen graphs.
Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math., 2016

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs.
Discret. Appl. Math., 2016

Minimum-Density Identifying Codes in Square Grids.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Snarks with total chromatic number 5.
Discret. Math. Theor. Comput. Sci., 2015

2014
The hunting of a snark with total chromatic number 5.
Discret. Appl. Math., 2014

2013
On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Generic algorithms for some decision problems on fasciagraphs and rotagraphs.
Discret. Math., 2012

Snarks with Total Chromatic Number 5.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2009
Characterizing path graphs by forbidden induced subgraphs.
J. Graph Theory, 2009

Maximum directed cuts in digraphs with degree restriction.
J. Graph Theory, 2009

2008
Graphic Submodular Function Minimization: A Graphic Approach and Applications.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2004
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math., 2004

2003
Imperfect and Nonideal Clutters: A Common Approach.
Comb., 2003

1999
Sequential Colorings and Perfect Graphs.
Discret. Appl. Math., 1999

1998
On minimal imperfect graphs with circular symmetry.
J. Graph Theory, 1998

1996
A generalization of simplicial elimination orderings.
J. Graph Theory, 1996

On the NP-completeness of the k-colorability problem for triangle-free graphs.
Discret. Math., 1996

Graphs with Largest Number of Minimum Cuts.
Discret. Appl. Math., 1996

1995
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
J. Comb. Theory, Ser. B, 1995

1994
Perfect graphs with no <i>P</i> <sub>5</sub> and no <i>K</i> <sub>5</sub>.
Graphs Comb., 1994

Linear Recognition of Pseudo-split Graphs.
Discret. Appl. Math., 1994

1992
A charming class of perfectly orderable graphs.
Discret. Math., 1992

1991
New properties of perfectly orderable graphs and strongly perfect graphs.
Discret. Math., 1991

1990
Locally perfect graphs.
J. Comb. Theory, Ser. B, 1990

1986
A note on superbrittle graphs.
Discret. Math., 1986

1985
A note on strong perfectness of graphs.
Math. Program., 1985

A class of strongly perfect graphs.
Discret. Math., 1985

1982
Snarks of order 18.
Discret. Math., 1982

1981
Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges).
PhD thesis, 1981

1980
Even polyhedral decompositions of cubic graphs.
Discret. Math., 1980


  Loading...