| Publication | Date of Publication | Type |
|---|
| Induced subgraphs and tree decompositions | 2025-01-14 | Paper |
| List-\(k\)-coloring \(H\)-free graphs for all \(k>4\) | 2025-01-14 | Paper |
| Induced subgraphs and tree decompositions. XIV: Non-adjacent neighbours in a hole | 2024-12-27 | Paper |
| Sparse induced subgraphs in \(P_6\)-free graphs | 2024-11-28 | Paper |
| Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets | 2024-11-09 | Paper |
| Graphs with no even holes and no sector wheels are the union of two chordal graphs | 2024-09-30 | Paper |
| Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws | 2024-07-19 | Paper |
| Tree independence number. I. (Even hole, diamond, pyramid)-free graphs | 2024-07-02 | Paper |
| Induced subgraphs of bounded treewidth and the container method | 2024-06-05 | Paper |
| Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring | 2024-03-19 | Paper |
| Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs | 2024-03-14 | Paper |
| Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring | 2024-02-28 | Paper |
| Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs | 2024-02-28 | Paper |
| Induced subgraphs and tree decompositions V. one neighbor in a hole | 2024-02-23 | Paper |
| Bipartite graphs with no \(K_6\) minor | 2024-01-29 | Paper |
| Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree | 2024-01-29 | Paper |
| Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs | 2024-01-29 | Paper |
| Characterizing and generalizing cycle completable graphs | 2024-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147372 | 2024-01-15 | Paper |
| The Structure of Metrizable Graphs | 2023-11-15 | Paper |
| List-$k$-Coloring $H$-free graphs for all $k>4$ | 2023-11-09 | Paper |
| Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole | 2023-11-09 | Paper |
| Induced subgraphs and tree decompositions XIII. Basic obstructions in $\mathcal{H}$-free graphs for finite $\mathcal{H}$ | 2023-11-08 | Paper |
| Pure pairs. X. Tournaments and the strong Erdős-Hajnal property | 2023-10-25 | Paper |
| Attempting perfect hypergraphs | 2023-10-23 | Paper |
| Reuniting $\chi$-boundedness with polynomial $\chi$-boundedness | 2023-10-17 | Paper |
| Proof of a conjecture of Plummer and Zha | 2023-10-12 | Paper |
| Graphs with no even holes and no sector wheels are the union of two chordal graphs | 2023-10-09 | Paper |
| Polynomial bounds for chromatic number VII. Disjoint holes | 2023-10-05 | Paper |
| Strongly perfect claw‐free graphs—A short proof | 2023-10-04 | Paper |
| Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs | 2023-09-21 | Paper |
| Erdős–Hajnal for graphs with no 5‐hole | 2023-09-20 | Paper |
| Strengthening Rödl's theorem | 2023-09-19 | Paper |
| Induced subgraphs and tree decompositions XI. Local structure in even-hole-free graphs of large treewidth | 2023-09-08 | Paper |
| Coloring graphs with no induced five‐vertex path or gem | 2023-08-22 | Paper |
| Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture | 2023-08-11 | Paper |
| Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs | 2023-07-25 | Paper |
| Sparse induced subgraphs in P_6-free graphs | 2023-07-14 | Paper |
| Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs | 2023-06-27 | Paper |
| Stable sets in flag spheres | 2023-06-05 | Paper |
| Induced subgraphs and tree decompositions IX. Grid theorem for perforated graphs | 2023-05-24 | Paper |
| Complexity of \(C_k\)-coloring in hereditary classes of graphs | 2023-05-19 | Paper |
| Even-hole-free graphs still have bisimplicial vertices | 2023-05-02 | Paper |
| Stable sets in flag spheres | 2023-04-27 | Paper |
| Polynomial bounds for chromatic number VI. Adding a four-vertex path | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874504 | 2023-02-07 | Paper |
| Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs | 2023-01-05 | Paper |
| Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree | 2022-09-23 | Paper |
| Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets | 2022-07-12 | Paper |
| Concatenating bipartite graphs | 2022-06-13 | Paper |
| Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs | 2022-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075768 | 2022-05-11 | Paper |
| Induced subgraphs and tree decompositions V. Small components of big vertices | 2022-04-06 | Paper |
| Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs | 2022-03-31 | Paper |
| Polynomial bounds for chromatic number VI. Adding a four-vertex path | 2022-02-21 | Paper |
| Finding a Shortest Odd Hole | 2022-02-16 | Paper |
| Rainbow paths and large rainbow matchings | 2022-02-01 | Paper |
| Avoidable vertices and edges in graphs: existence, characterization, and applications | 2022-01-13 | Paper |
| Tournaments and the strong Erdős-Hajnal property | 2022-01-07 | Paper |
| Subdivided claws and the clique-stable set separation property | 2021-12-10 | Paper |
| Graphs with polynomially many minimal separators | 2021-11-17 | Paper |
| Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes | 2021-11-04 | Paper |
| Stable sets in flag spheres | 2021-10-27 | Paper |
| Erdős-Hajnal for cap-free graphs | 2021-09-16 | Paper |
| Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth | 2021-09-03 | Paper |
| Pure pairs. II: Excluding all subdivisions of a graph | 2021-08-03 | Paper |
| A note on simplicial cliques | 2021-07-08 | Paper |
| Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings | 2021-07-06 | Paper |
| Detecting a long odd hole | 2021-06-25 | Paper |
| Square-free graphs with no induced fork | 2021-05-11 | Paper |
| New examples of minimal non-strongly-perfect graphs | 2021-03-25 | Paper |
| On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five | 2021-03-12 | Paper |
| Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs | 2021-02-02 | Paper |
| List 3-coloring graphs with no induced \(P_6 + rP_3\) | 2021-02-01 | Paper |
| Better 3-coloring algorithms: excluding a triangle and a seven vertex path | 2020-12-16 | Paper |
| Pure pairs. I: Trees and linear anticomplete pairs | 2020-12-03 | Paper |
| Detecting an Odd Hole | 2020-11-11 | Paper |
| Proof of the Kalai-Meshulam conjecture | 2020-09-15 | Paper |
| List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\) | 2020-09-10 | Paper |
| Induced equators in flag spheres | 2020-09-07 | Paper |
| Holes with hats and Erd\H{o}s-Hajnal | 2020-05-06 | Paper |
| Complexity of $C_k$-coloring in hereditary classes of graphs | 2020-05-04 | Paper |
| Finding a shortest odd hole | 2020-04-24 | Paper |
| Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs | 2020-04-07 | Paper |
| Excluding the fork and antifork | 2020-03-20 | Paper |
| Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs | 2020-02-20 | Paper |
| Cooperative colorings of trees and of bipartite graphs | 2020-02-10 | Paper |
| Towards Erdős-Hajnal for graphs with no 5-hole | 2020-01-17 | Paper |
| Avoidable vertices and edges in graphs | 2020-01-16 | Paper |
| Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes | 2020-01-15 | Paper |
| Obstructions for three-coloring graphs without induced paths on six vertices | 2020-01-15 | Paper |
| Induced subgraphs of graphs with large chromatic number. XII. Distant stars | 2019-12-30 | Paper |
| Maximum independent sets in (pyramid, even hole)-free graphs | 2019-12-24 | Paper |
| Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable | 2019-10-31 | Paper |
| Four-coloring P6-free graphs | 2019-10-15 | Paper |
| Small families under subdivision | 2019-10-10 | Paper |
| Avoidable Vertices and Edges in Graphs | 2019-07-28 | Paper |
| Approximately coloring graphs without long induced paths | 2019-06-27 | Paper |
| Large rainbow matchings in general graphs | 2019-06-18 | Paper |
| Perfect divisibility and 2‐divisibility | 2019-06-14 | Paper |
| Coloring square-free Berge graphs | 2019-02-08 | Paper |
| Disjoint paths in unions of tournaments | 2019-02-08 | Paper |
| Induced subgraphs of graphs with large chromatic number. XI. Orientations | 2018-12-20 | Paper |
| On the Erdős-Hajnal conjecture for six-vertex tournaments | 2018-11-15 | Paper |
| Vertex-minors and the Erdős-Hajnal conjecture | 2018-10-23 | Paper |
| The sandwich problem for decompositions and almost monotone properties | 2018-10-18 | Paper |
| Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs | 2018-10-11 | Paper |
| Sparse graphs with no polynomial-sized anticomplete pairs | 2018-09-28 | Paper |
| Three-coloring and list three-coloring of graphs without induced paths on seven vertices | 2018-09-24 | Paper |
| Induced subgraphs of graphs with large chromatic number. III: Long holes | 2018-07-23 | Paper |
| Obstructions for three-coloring graphs with one forbidden induced subgraph | 2018-07-16 | Paper |
| List-three-coloring graphs with no induced $P_6+rP_3$ | 2018-06-28 | Paper |
| Triangle-free graphs with no six-vertex induced path | 2018-06-07 | Paper |
| Piercing axis-parallel boxes | 2018-05-25 | Paper |
| 3-Colorable Subclasses of $P_8$-Free Graphs | 2018-05-18 | Paper |
| Even pairs and prism corners in square-free Berge graphs | 2018-05-09 | Paper |
| Odd Holes in Bull-Free Graphs | 2018-04-27 | Paper |
| A short proof of the wonderful lemma | 2018-04-27 | Paper |
| Domination in tournaments | 2018-04-18 | Paper |
| Fair Representation by Independent Sets | 2018-02-26 | Paper |
| Approximately coloring graphs without long induced paths | 2018-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4589007 | 2017-11-06 | Paper |
| Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs | 2017-09-26 | Paper |
| 4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles | 2017-04-21 | Paper |
| Graphs with No Induced Five‐Vertex Path or Antipath | 2017-04-21 | Paper |
| Excluding paths and antipaths | 2017-03-31 | Paper |
| Colouring perfect graphs with bounded clique number | 2016-11-25 | Paper |
| Disjoint dijoins | 2016-06-03 | Paper |
| Unavoidable induced subgraphs in large graphs with no homogeneous sets | 2016-03-14 | Paper |
| Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures | 2016-03-14 | Paper |
| Immersion in four-edge-connected graphs | 2015-12-11 | Paper |
| Bipartite minors | 2015-12-11 | Paper |
| Cliques and stable sets in undirected graphs | 2015-10-20 | Paper |
| Coloring perfect graphs with no balanced skew-partitions | 2015-08-21 | Paper |
| Edge-colouring seven-regular planar graphs | 2015-08-21 | Paper |
| Edge-colouring eight-regular planar graphs | 2015-08-21 | Paper |
| Cliques in the union of graphs | 2015-06-22 | Paper |
| Wheel-free planar graphs | 2015-06-18 | Paper |
| Excluding a Substar and an Antisubstar | 2015-05-20 | Paper |
| Forcing large transitive subtournaments | 2015-05-04 | Paper |
| A de Bruijn-Erdős theorem for chordal graphs | 2015-04-22 | Paper |
| Three-coloring graphs with no induced seven-vertex path II : using a triangle | 2015-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934642 | 2014-12-18 | Paper |
| Disjoint paths in tournaments | 2014-12-12 | Paper |
| Tournaments with near-linear transitive subsets | 2014-10-22 | Paper |
| Detecting an induced net subdivision | 2014-10-13 | Paper |
| Substitution and \(\chi\)-boundedness | 2014-10-13 | Paper |
| Three-coloring graphs with no induced seven-vertex path I : the triangle-free case | 2014-09-17 | Paper |
| Excluding pairs of graphs | 2014-08-28 | Paper |
| Rao's degree sequence conjecture | 2014-08-27 | Paper |
| Extending the Gyárfás-Sumner conjecture | 2014-08-27 | Paper |
| Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH6-Conjecture | 2014-08-07 | Paper |
| Perfect matchings in planar cubic graphs | 2014-06-13 | Paper |
| A counterexample to a conjecture of Schwartz | 2014-05-30 | Paper |
| The Structure of Claw‐Free Perfect Graphs | 2014-05-22 | Paper |
| Lines in hypergraphs | 2014-03-17 | Paper |
| The Erdős-Hajnal conjecture. A survey | 2014-01-28 | Paper |
| The structure of bull-free perfect graphs | 2013-10-09 | Paper |
| On the Erd\"os-Lov\'asz Tihany Conjecture for Claw-Free Graphs | 2013-09-04 | Paper |
| Packing seagulls | 2013-08-06 | Paper |
| Finding minimum clique capacity | 2013-08-06 | Paper |
| Clique numbers of graph unions | 2013-07-24 | Paper |
| A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs | 2013-06-27 | Paper |
| Excluding four-edge paths and their complements | 2013-02-02 | Paper |
| Tournaments and colouring | 2013-01-18 | Paper |
| Claw-free graphs. VII. Quasi-line graphs | 2013-01-14 | Paper |
| Growing without cloning | 2012-09-12 | Paper |
| Excluding induced subdivisions of the bull and related graphs | 2012-09-12 | Paper |
| Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement | 2012-08-31 | Paper |
| Three-colourable perfect graphs without even pairs | 2012-05-04 | Paper |
| Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs | 2012-04-30 | Paper |
| Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures | 2012-04-30 | Paper |
| The structure of bull-free graphs I -- three-edge-paths with centers and anticenters | 2012-03-19 | Paper |
| The structure of bull-free graphs II and III -- a summary | 2012-03-19 | Paper |
| Tournament immersion and cutwidth | 2012-03-19 | Paper |
| The three-in-a-tree problem | 2011-12-19 | Paper |
| Optimal antithickenings of claw-free trigraphs | 2011-10-23 | Paper |
| The edge-density for \(K_{2,t}\) minors | 2011-01-14 | Paper |
| A well-quasi-order for tournaments | 2011-01-14 | Paper |
| Claw-free graphs. VI: Colouring | 2010-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747947 | 2010-09-14 | Paper |
| An approximate version of Hadwiger's conjecture for claw-free graphs | 2010-04-22 | Paper |
| \(K_{4}\)-free graphs with no odd holes | 2010-04-21 | Paper |
| Detecting a Theta or a Prism | 2009-08-20 | Paper |
| Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs | 2009-06-19 | Paper |
| Even pairs in Berge graphs | 2009-03-04 | Paper |
| Claw-free graphs. V. Global structure | 2008-12-08 | Paper |
| The Erdős-Hajnal conjecture for bull-free graphs | 2008-12-08 | Paper |
| Bisimplicial vertices in even-hole-free graphs | 2008-12-08 | Paper |
| An algorithm for packing non-zero \(A\)-paths in group-labelled graphs | 2008-10-21 | Paper |
| Cycles in dense digraphs | 2008-10-21 | Paper |
| Hadwiger's conjecture for quasi-line graphs | 2008-10-08 | Paper |
| Claw-free graphs. IV: Decomposition theorem | 2008-10-07 | Paper |
| Claw-free graphs. III: Circular interval graphs | 2008-07-24 | Paper |
| Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs | 2008-04-16 | Paper |
| Claw-free graphs. II: Non-orientable prismatic graphs | 2008-03-14 | Paper |
| Solution of three problems of Cornuéjols | 2007-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5421811 | 2007-10-24 | Paper |
| Claw-free graphs. I: Orientable prismatic graphs | 2007-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439668 | 2007-05-29 | Paper |
| Packing non-zero \(A\)-paths in group-labelled graphs | 2007-05-08 | Paper |
| The roots of the independence polynomial of a clawfree graph | 2007-04-16 | Paper |
| Coloring quasi-line graphs | 2007-01-24 | Paper |
| The structure of claw-free graphs | 2007-01-19 | Paper |
| The strong perfect graph theorem | 2007-01-04 | Paper |
| Berge trigraphs | 2006-09-12 | Paper |
| Recognizing Berge graphs | 2006-06-27 | Paper |
| Detecting even holes | 2005-04-21 | Paper |
| Progress on perfect graphs | 2003-09-01 | Paper |
| Triangulated spheres and colored cliques | 2003-03-17 | Paper |
| Submodular functions and perfect graphs | N/A | Paper |
| Even pairs in Berge graphs with no balanced skew-partitions | N/A | Paper |
| Tree independence number I. (Even hole, diamond, pyramid)-free graphs | N/A | Paper |
| On prime Cayley graphs | N/A | Paper |
| Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth | N/A | Paper |
| Tree independence number II. Three-path-configurations | N/A | Paper |
| Unavoidable induced subgraphs in graphs with complete bipartite induced minors | N/A | Paper |
