| Publication | Date of Publication | Type |
|---|
Recoloring some hereditary graph classes
Discrete Applied Mathematics | 2025-01-06 | Paper |
Reconfiguration of vertex colouring and forbidden induced subgraphs
European Journal of Combinatorics | 2024-03-26 | Paper |
An optimal χ‐bound for (P6, diamond)‐free graphs
Journal of Graph Theory | 2023-10-04 | Paper |
A PPA parity theorem about trees in a bipartite graph
Discrete Applied Mathematics | 2022-01-05 | Paper |
A parity theorem about trees with specified degrees
Discrete Applied Mathematics | 2021-10-21 | Paper |
| Hadwiger's conjecture for some hereditary classes of graphs: a survey | 2021-08-30 | Paper |
\(k\)-critical graphs in \(P_5\)-free graphs
Lecture Notes in Computer Science | 2021-04-21 | Paper |
\(k\)-critical graphs in \(P_5\)-free graphs
Theoretical Computer Science | 2021-04-08 | Paper |
The class of \((P_7, C_4, C_5)\)-free graphs: decomposition, algorithms, and \(\chi \)-boundedness
Journal of Graph Theory | 2020-05-21 | Paper |
Cycles containing all the odd-degree vertices
Journal of Combinatorial Theory. Series B | 2020-04-22 | Paper |
A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
Bulletin of the Australian Mathematical Society | 2019-09-13 | Paper |
Solving the clique cover problem on (bull, \(C_4\))-free graphs
Discrete Applied Mathematics | 2019-05-17 | Paper |
On the structure of (pan, even hole)-free graphs
Journal of Graph Theory | 2018-02-23 | Paper |
Structure and algorithms for (cap, even hole)-free graphs
Discrete Mathematics | 2017-12-20 | Paper |
Structure and algorithms for (cap, even hole)-free graphs
Discrete Mathematics | 2017-12-20 | Paper |
| Induced matchings in intersection graphs | 2016-07-01 | Paper |
| On 2-e.c. graphs, tournaments, and hypergraphs | 2016-07-01 | Paper |
Edge intersection graphs of \(L\)-shaped paths in grids
Discrete Applied Mathematics | 2016-06-22 | Paper |
| The list partition problem for graphs | 2015-08-03 | Paper |
Asteroids in rooted and directed path graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Coloring vertices of a graph or finding a Meyniel obstruction
Theoretical Computer Science | 2012-05-30 | Paper |
Characterizing directed path graphs by forbidden asteroids
Journal of Graph Theory | 2011-10-12 | Paper |
| Finding a strong stable set or a Meyniel obstruction in any graph | 2010-07-30 | Paper |
On the structure of certain intersection graphs
Information Processing Letters | 2010-01-29 | Paper |
Brambles and independent packings in chordal graphs
Discrete Mathematics | 2009-12-15 | Paper |
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
The travelling preacher, projection, and a lower bound for the stability number of a graph
Discrete Optimization | 2008-10-29 | Paper |
Colouring Some Classes of Perfect Graphs Robustly
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5130726 (Why is no real title available?) | 2007-03-05 | Paper |
On an adjacency property of almost all tournaments
Discrete Mathematics | 2006-10-30 | Paper |
Independent packings in structured graphs
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
The graphs with maximum induced matching and maximum matching the same size
Discrete Mathematics | 2005-10-10 | Paper |
| scientific article; zbMATH DE number 2192124 (Why is no real title available?) | 2005-08-04 | Paper |
Induced matchings in intersection graphs.
Discrete Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1953189 (Why is no real title available?) | 2003-07-25 | Paper |
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics | 2003-06-09 | Paper |
Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
Discrete Mathematics | 2001-12-04 | Paper |
On an adjacency property of almost all graphs
Discrete Mathematics | 2001-11-28 | Paper |
On 2-e. c. line-critical graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2001-11-18 | Paper |
A min-max relation for monotone path systems in simple regions
Combinatorica | 2001-04-01 | Paper |
Some graphic uses of an even number of odd nodes
Annales de l’institut Fourier | 1999-07-12 | Paper |
Some graphic uses of an even number of odd nodes
Annales de l’institut Fourier | 1999-07-12 | Paper |
| Lambda composition | 1997-12-07 | Paper |
Coloured matchings in bipartite graphs
Discrete Mathematics | 1997-01-01 | Paper |
Monotone path systems in simple regions
Combinatorica | 1996-06-05 | Paper |
Coflow polyhedra
Discrete Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 26478 (Why is no real title available?) | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4199652 (Why is no real title available?) | 1990-01-01 | Paper |
An algorithmic note on the gallai-milgram theorem
Networks | 1990-01-01 | Paper |
Induced matchings
Discrete Applied Mathematics | 1989-01-01 | Paper |
A min-max relation for the partial q-colourings of a graph. II: Box perfection
Discrete Mathematics | 1989-01-01 | Paper |
A note on perfect graphs
Periodica Mathematica Hungarica | 1986-01-01 | Paper |
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
European Journal of Combinatorics | 1986-01-01 | Paper |
Antichain sequences
Order | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3674145 (Why is no real title available?) | 1979-01-01 | Paper |
Recoloring some hereditary graph classes
(available as arXiv preprint) | N/A | Paper |
The sandwich problem for odd-hole-free and even-hole-free graphs
(available as arXiv preprint) | N/A | Paper |
