| Publication | Date of Publication | Type |
|---|
| On some classes of quasi-triangulated graphs | 2024-11-06 | Paper |
| Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs | 2024-03-26 | Paper |
| A closure lemma for tough graphs and Hamiltonian degree conditions | 2024-02-19 | Paper |
| Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs | 2023-12-22 | Paper |
| A class of graphs with large rankwidth | 2023-10-30 | Paper |
| A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs | 2023-05-23 | Paper |
| On coloring a class of claw-free and hole-twin-free graphs | 2022-11-02 | Paper |
| On the structure of graphs without claw, \(4K_1\) and co-R | 2022-07-26 | Paper |
| On coloring a class of claw-free graphs. | 2022-04-27 | Paper |
| Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs | 2022-04-19 | Paper |
| Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four | 2022-03-24 | Paper |
| Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four | 2020-06-30 | Paper |
| The intersection of two vertex coloring problems | 2020-03-03 | Paper |
| Classes of graphs with \(e\)-positive chromatic symmetric function | 2019-09-30 | Paper |
| Chromatic symmetric functions and \(H\)-free graphs | 2019-06-28 | Paper |
| Solving the clique cover problem on (bull, \(C_4\))-free graphs | 2019-05-17 | Paper |
| On the structure of (even hole, kite)-free graphs | 2019-01-11 | Paper |
| On the structure of (banner, odd hole)‐free graphs | 2019-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635984 | 2018-04-23 | Paper |
| On the structure of (pan, even hole)‐free graphs | 2018-02-23 | Paper |
| A coloring algorithm for \(4 K_1\)-free line graphs | 2017-12-20 | Paper |
| Characterizations of \((4 K_1,C_4,C_5)\)-free graphs | 2017-09-12 | Paper |
| On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs | 2016-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501285 | 2015-08-03 | Paper |
| A Coloring Algorithm for $4K_1$-free line graphs | 2015-06-18 | Paper |
| Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes | 2015-05-22 | Paper |
| Finding and listing induced paths and cycles | 2013-03-12 | Paper |
| Finding a sun in building-free graphs | 2012-12-27 | Paper |
| A characterization of \(b\)-perfect graphs | 2012-09-12 | Paper |
| Characterizing directed path graphs by forbidden asteroids | 2011-10-12 | Paper |
| On graphs without a \(C_{4}\) or a diamond | 2011-04-19 | Paper |
| On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two | 2011-02-18 | Paper |
| On the Complexity of Finding a Sun in a Graph | 2010-12-03 | Paper |
| On minimally \(b\)-imperfect graphs | 2010-04-28 | Paper |
| Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time | 2010-03-04 | Paper |
| On the structure of certain intersection graphs | 2010-01-29 | Paper |
| A Certifying Algorithm for 3-Colorability of P 5-Free Graphs | 2009-12-17 | Paper |
| Maximum induced matchings for chordal graphs in linear time | 2009-05-13 | Paper |
| A Note on k-Colorability of P 5-Free Graphs | 2009-02-03 | Paper |
| The Complexity of the List Partition Problem for Graphs | 2008-12-05 | Paper |
| On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem | 2008-01-07 | Paper |
| A Note on Quasi‐triangulated Graphs | 2007-09-06 | Paper |
| On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem | 2007-08-30 | Paper |
| An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs | 2007-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424773 | 2007-03-05 | Paper |
| A characterization of \(P_{4}\)-comparability graphs | 2006-10-30 | Paper |
| On the \(b\)-dominating coloring of graphs | 2005-12-27 | Paper |
| On the Co-P3 -Structure of Perfect Graphs | 2005-09-16 | Paper |
| Disjoint clique cutsets in graphs without long holes | 2005-05-04 | Paper |
| On minimal prime extensions of a four-vertex graph in a prime graph | 2005-01-13 | Paper |
| On simplicial and co-simplicial vertices in graphs. | 2004-03-29 | Paper |
| Coloring the hypergraph of maximal cliques of a graph with no long path | 2003-11-25 | Paper |
| Stability number of bull- and chair-free graphs revisited | 2003-09-25 | Paper |
| On the disc-structure of perfect graphs. II: The co-\(C_4\)-structure | 2002-08-29 | Paper |
| On the divisibility of graphs | 2002-06-24 | Paper |
| Finding houses and holes in graphs | 2001-08-20 | Paper |
| \(P_4\)-colorings and \(P_4\)-bipartite graphs | 2001-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949883 | 2001-05-08 | Paper |
| On \(P_4\)-transversals of perfect graphs | 2001-02-13 | Paper |
| Planar segment visibility graphs | 2000-09-14 | Paper |
| On the perfect orderability of unions of two graphs | 2000-09-10 | Paper |
| On the disc-structure of perfect graphs. I: The co-paw-structure | 2000-08-03 | Paper |
| Recognizing Perfect 2-Split Graphs | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256088 | 2000-01-25 | Paper |
| On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs | 1997-09-24 | Paper |
| A note on perfectly orderable graphs | 1997-03-31 | Paper |
| Some properties of minimal imperfect graphs | 1997-01-14 | Paper |
| On the complexity of recognizing a class of perfectly orderable graphs | 1996-07-07 | Paper |
| Hamiltonian degree conditions for tough graphs | 1995-08-27 | Paper |
| Efficient algorithms for minimum weighted colouring of some classes of perfect graphs | 1995-07-05 | Paper |
| On the two‐edge‐colorings of perfect graphs | 1995-03-20 | Paper |
| On slim graphs, even pairs, and star-cutsets | 1993-01-16 | Paper |
| A parallel algorithm for minimum weighted colouring of triangulated graphs | 1992-09-27 | 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 |
| On the sibling-structure of perfect graphs | 1990-01-01 | Paper |
| Some classes of perfectly orderable graphs | 1989-01-01 | Paper |
| Opposition graphs are strict quasi-parity graphs | 1989-01-01 | Paper |
| \(P_ 4\)-comparability graphs | 1989-01-01 | Paper |
| A note on perfect orders | 1989-01-01 | Paper |
| On brittle graphs | 1988-01-01 | Paper |
| On a conjecture of Meyniel | 1987-01-01 | Paper |
| A note on short cycles in digraphs | 1987-01-01 | Paper |
| Alternating orientation and alternating colouration of perfect graphs | 1987-01-01 | Paper |
