Myriam Preissmann

Available identifiers

zbMath Open preissmann.myriamMaRDI QIDQ442401

List of research outcomes

Publication	Date of Publication	Type
Results about the total chromatic number and the conformability of some families of circulant graphs	2023-09-14	Paper
When all holes have the same length	2022-03-22	Paper
Graphs with all holes the same length	2021-10-19	Paper
On the complexity of colouring antiprismatic graphs	2021-03-26	Paper
On the complexity of colouring antiprismatic graphs	2019-10-24	Paper
On more variants of the majority problem	2019-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q5377234	2019-05-23	Paper
Graphic Submodular Function Minimization: A Graphic Approach and Applications	2017-04-07	Paper
Minimum-Density Identifying Codes in Square Grids	2016-11-09	Paper
On the equitable total chromatic number of cubic graphs	2016-06-21	Paper
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs	2016-05-18	Paper
On the total coloring of generalized Petersen graphs	2016-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q5502080	2015-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4982372	2015-04-09	Paper
The hunting of a snark with total chromatic number 5	2014-05-05	Paper
Generic algorithms for some decision problems on fasciagraphs and rotagraphs	2012-08-10	Paper
Optimal cuts in graphs and statistical mechanics	2010-05-02	Paper
Characterizing path graphs by forbidden induced subgraphs	2009-12-18	Paper
Maximum directed cuts in digraphs with degree restriction	2009-06-16	Paper
Coloring the Maximal Cliques of Graphs	2005-02-28	Paper
Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states	2004-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q2758338	2002-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q2758332	2002-03-13	Paper
Sequential colorings and perfect graphs	2000-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q4242951	1999-08-31	Paper
On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs	1997-06-10	Paper
Graphs with largest number of minimum cuts	1997-03-23	Paper
A generalization of simplicial elimination orderings	1996-11-25	Paper
Split-neighbourhood graphs and the strong perfect graph conjecture	1995-07-02	Paper
Linear recognition of pseudo-split graphs	1995-01-26	Paper
Perfect graphs with no \(P_ 5\) and no \(K_ 5\)	1994-09-26	Paper
A charming class of perfectly orderable graphs	1992-09-27	Paper
New properties of perfectly orderable graphs and strongly perfect graphs	1992-06-28	Paper
Locally perfect graphs	1990-01-01	Paper
A note on superbrittle graphs	1986-01-01	Paper
A class of strongly perfect graphs	1985-01-01	Paper
A note on strong perfectness of graphs	1985-01-01	Paper
C-Minimal Snarks	1983-01-01	Paper
Snarks of order 18	1982-01-01	Paper
Even polyhedral decompositions of cubic graphs	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Myriam Preissmann