| Publication | Date of Publication | Type |
|---|
On the structure of (dart, odd hole)-free graphs
Graphs and Combinatorics | 2026-08-21 | Paper |
On graphs without four-vertex induced subgraphs
Discrete Applied Mathematics | 2026-05-08 | Paper |
On the structure of perfectly divisible graphs
Discrete Mathematics | 2025-12-15 | Paper |
On some classes of quasi-triangulated graphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs
Graphs and Combinatorics | 2024-03-26 | Paper |
A closure lemma for tough graphs and Hamiltonian degree conditions
Discrete Mathematics | 2024-02-19 | Paper |
Vertex-critical ( P₃ + P₁ )-free and vertex-critical (gem, co-gem)-free graphs
Discrete Applied Mathematics | 2023-12-22 | Paper |
A class of graphs with large rankwidth
Discrete Mathematics | 2023-10-30 | Paper |
A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
Theoretical Computer Science | 2023-05-23 | Paper |
On coloring a class of claw-free and hole-twin-free graphs
Discrete Applied Mathematics | 2022-11-02 | Paper |
On the structure of graphs without claw, \(4K_1\) and co-R
Graphs and Combinatorics | 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
Theoretical Computer Science | 2022-04-19 | Paper |
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
Discrete Applied Mathematics | 2022-03-24 | Paper |
Dichotomizing k-vertex-critical H-free graphs for H of order four
(available as arXiv preprint) | 2020-06-30 | Paper |
The intersection of two vertex coloring problems
Graphs and Combinatorics | 2020-03-03 | Paper |
Classes of graphs with \(e\)-positive chromatic symmetric function
The Electronic Journal of Combinatorics | 2019-09-30 | Paper |
Classes of graphs with \(e\)-positive chromatic symmetric function
The Electronic Journal of Combinatorics | 2019-09-30 | Paper |
Chromatic symmetric functions and \(H\)-free graphs
Graphs and Combinatorics | 2019-06-28 | Paper |
Solving the clique cover problem on (bull, \(C_4\))-free graphs
Discrete Applied Mathematics | 2019-05-17 | Paper |
On the structure of (even hole, kite)-free graphs
Graphs and Combinatorics | 2019-01-11 | Paper |
On the structure of (banner, odd hole)-free graphs
Journal of Graph Theory | 2019-01-03 | Paper |
| Perfect graphs | 2018-04-23 | Paper |
On the structure of (pan, even hole)-free graphs
Journal of Graph Theory | 2018-02-23 | Paper |
A coloring algorithm for \(4 K_1\)-free line graphs
Discrete Applied Mathematics | 2017-12-20 | Paper |
Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
Discrete Applied Mathematics | 2017-09-12 | Paper |
On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
| The list partition problem for graphs | 2015-08-03 | Paper |
| A Coloring Algorithm for 4K₁-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
Discrete Applied Mathematics | 2015-05-22 | Paper |
Finding and listing induced paths and cycles
Discrete Applied Mathematics | 2013-03-12 | Paper |
Finding a sun in building-free graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
A characterization of b-perfect graphs
Journal of Graph Theory | 2012-09-12 | Paper |
Characterizing directed path graphs by forbidden asteroids
Journal of Graph Theory | 2011-10-12 | Paper |
On graphs without a \(C_{4}\) or a diamond
Discrete Applied Mathematics | 2011-04-19 | Paper |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Discrete Mathematics | 2011-02-18 | Paper |
On the complexity of finding a sun in a graph
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
On minimally \(b\)-imperfect graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
Algorithmica | 2010-03-04 | Paper |
On the structure of certain intersection graphs
Information Processing Letters | 2010-01-29 | Paper |
A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
Maximum induced matchings for chordal graphs in linear time
Algorithmica | 2009-05-13 | Paper |
A Note on k-Colorability of P 5-Free Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science | 2008-01-07 | Paper |
A Note on Quasi‐triangulated Graphs
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
| scientific article; zbMATH DE number 5130726 (Why is no real title available?) | 2007-03-05 | Paper |
A characterization of \(P_{4}\)-comparability graphs
Discrete Mathematics | 2006-10-30 | Paper |
On the \(b\)-dominating coloring of graphs
Discrete Applied Mathematics | 2005-12-27 | Paper |
On the Co-<i>P</i><sub>3</sub> -Structure of Perfect Graphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Disjoint clique cutsets in graphs without long holes
Journal of Graph Theory | 2005-05-04 | Paper |
On minimal prime extensions of a four-vertex graph in a prime graph
Discrete Mathematics | 2005-01-13 | Paper |
On simplicial and co-simplicial vertices in graphs.
Discrete Applied Mathematics | 2004-03-29 | Paper |
Coloring the hypergraph of maximal cliques of a graph with no long path
Discrete Mathematics | 2003-11-25 | Paper |
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics | 2003-09-25 | Paper |
On the disc-structure of perfect graphs. II: The co-\(C_4\)-structure
Discrete Mathematics | 2002-08-29 | Paper |
On the divisibility of graphs
Discrete Mathematics | 2002-06-24 | Paper |
Finding houses and holes in graphs
Theoretical Computer Science | 2001-08-20 | Paper |
P₄-colorings and P₄-bipartite graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2001-06-18 | Paper |
P₄-colorings and P₄-bipartite graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2001-06-18 | Paper |
| scientific article; zbMATH DE number 1439504 (Why is no real title available?) | 2001-05-08 | Paper |
On P₄-transversals of perfect graphs
Discrete Mathematics | 2001-02-13 | Paper |
Planar segment visibility graphs
Computational Geometry | 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
Discrete Applied Mathematics | 2000-08-03 | Paper |
Recognizing Perfect 2-Split Graphs
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1309107 (Why is no real title available?) | 2000-01-25 | Paper |
On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
Journal of Combinatorial Theory. Series B | 1997-09-24 | Paper |
A note on perfectly orderable graphs
Discrete Applied Mathematics | 1997-03-31 | Paper |
Some properties of minimal imperfect graphs
Discrete Mathematics | 1997-01-14 | Paper |
On the complexity of recognizing a class of perfectly orderable graphs
Discrete Applied Mathematics | 1996-07-07 | Paper |
Hamiltonian degree conditions for tough graphs
Discrete Mathematics | 1995-08-27 | Paper |
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Applied Mathematics | 1995-07-05 | Paper |
On the two‐edge‐colorings of perfect graphs
Journal of Graph Theory | 1995-03-20 | Paper |
On slim graphs, even pairs, and star-cutsets
Discrete Mathematics | 1993-01-16 | Paper |
A charming class of perfectly orderable graphs
Discrete Mathematics | 1992-09-27 | Paper |
A parallel algorithm for minimum weighted colouring of triangulated graphs
Theoretical Computer Science | 1992-09-27 | Paper |
New properties of perfectly orderable graphs and strongly perfect graphs
Discrete Mathematics | 1992-06-28 | Paper |
On the sibling-structure of perfect graphs
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
Opposition graphs are strict quasi-parity graphs
Graphs and Combinatorics | 1989-01-01 | Paper |
\(P_ 4\)-comparability graphs
Discrete Mathematics | 1989-01-01 | Paper |
A note on perfect orders
Discrete Mathematics | 1989-01-01 | Paper |
Some classes of perfectly orderable graphs
Journal of Graph Theory | 1989-01-01 | Paper |
On brittle graphs
Journal of Graph Theory | 1988-01-01 | Paper |
Alternating orientation and alternating colouration of perfect graphs
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
On a conjecture of Meyniel
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
A note on short cycles in digraphs
Discrete Mathematics | 1987-01-01 | Paper |
