2025
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole.
Eur. J. Comb., 2025
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets.
Discret. Math., 2025
2024
List-k-Coloring H-Free Graphs for All k>4.
Comb., October, 2024
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.
Comb., October, 2024
Induced subgraphs and tree decompositions V. one neighbor in a hole.
J. Graph Theory, April, 2024
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.
SIAM J. Discret. Math., March, 2024
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring.
SIAM J. Comput., February, 2024
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring.
SIAM J. Comput., February, 2024
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs.
SIAM J. Comput., February, 2024
Characterizing and generalizing cycle completable graphs.
Discret. Math., February, 2024
Bipartite graphs with no <i>K</i><sub>6</sub> minor.
J. Comb. Theory B, January, 2024
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.
J. Comb. Theory B, January, 2024
Induced subgraphs and tree decompositions VII. Basic obstructions in <i>H</i>-free graphs.
J. Comb. Theory B, January, 2024
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.
Eur. J. Comb., January, 2024
Induced Subgraphs of Bounded Treewidth and the Container Method.
SIAM J. Comput., 2024
Graphs with no even holes and no sector wheels are the union of two chordal graphs.
Eur. J. Comb., 2024
Tree Independence Number IV. Even-hole-free Graphs.
CoRR, 2024
Unavoidable induced subgraphs in graphs with complete bipartite induced minors.
CoRR, 2024
Max Weight Independent Set in Sparse Graphs with No Long Claws.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Sparse induced subgraphs in <i>P</i><sub>6</sub>-free graphs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Polynomial bounds for chromatic number VII. Disjoint holes.
J. Graph Theory, November, 2023
Strengthening Rödl's theorem.
J. Comb. Theory B, November, 2023
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture.
SIAM J. Discret. Math., September, 2023
Proof of a conjecture of Plummer and Zha.
J. Graph Theory, July, 2023
Even-hole-free graphs still have bisimplicial vertices.
J. Comb. Theory B, July, 2023
Complexity of <i>C</i><sub><i>k</i></sub>-coloring in hereditary classes of graphs.
Inf. Comput., June, 2023
Polynomial bounds for chromatic number VI. Adding a four-vertex path.
Eur. J. Comb., May, 2023
Stable sets in flag spheres.
Eur. J. Comb., May, 2023
Reuniting χ-boundedness with polynomial χ-boundedness.
CoRR, 2023
Sparse induced subgraphs in P_6-free graphs.
CoRR, 2023
Cops and robbers on P<sub>5</sub>-free graphs.
CoRR, 2023
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.
Electron. J. Comb., 2023
2022
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports, November, 2022
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree.
J. Comb. Theory B, 2022
Graphs with polynomially many minimal separators.
J. Comb. Theory B, 2022
Tournaments and the strong Erdős-Hajnal Property.
Eur. J. Comb., 2022
Avoidable vertices and edges in graphs: Existence, characterization, and applications.
Discret. Appl. Math., 2022
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.
Electron. J. Comb., 2022
Concatenating Bipartite Graphs.
Electron. J. Comb., 2022
Rainbow Paths and Large Rainbow Matchings.
Electron. J. Comb., 2022
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
2021
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.
Theor. Comput. Sci., 2021
Finding a Shortest Odd Hole.
ACM Trans. Algorithms, 2021
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.
SIAM J. Discret. Math., 2021
Strongly perfect claw-free graphs - A short proof.
J. Graph Theory, 2021
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
J. Comb. Theory B, 2021
Erdős-Hajnal for cap-free graphs.
J. Comb. Theory B, 2021
A note on simplicial cliques.
Discret. Math., 2021
New examples of minimal non-strongly-perfect graphs.
Discret. Math., 2021
Square-Free Graphs with no Induced Fork.
Electron. J. Comb., 2021
Pure Pairs. II. Excluding All Subdivisions of A Graph.
Comb., 2021
Detecting a Long Odd Hole.
Comb., 2021
List 3-Coloring Graphs with No Induced P<sub>6+rP<sub>3</sub></sub>.
Algorithmica, 2021
2020
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five.
SIAM J. Discret. Math., 2020
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.
SIAM J. Discret. Math., 2020
Coloring graphs with no induced five-vertex path or gem.
J. Graph Theory, 2020
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.
J. Graph Theory, 2020
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".
J. Comb. Theory B, 2020
Induced equators in flag spheres.
J. Comb. Theory A, 2020
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.
J. Comb. Theory, Ser. B, 2020
Obstructions for three-coloring graphs without induced paths on six vertices.
J. Comb. Theory, Ser. B, 2020
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s.
Discret. Math., 2020
Excluding the fork and antifork.
Discret. Math., 2020
List-three-coloring P<sub>t</sub>-free graphs with no induced 1-subdivision of K<sub>1, s</sub>.
CoRR, 2020
Cooperative Colorings of Trees and of Bipartite Graphs.
Electron. J. Comb., 2020
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Perfect divisibility and 2-divisibility.
J. Graph Theory, 2019
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.
J. Graph Theory, 2019
Induced subgraphs of graphs with large chromatic number. XII. Distant stars.
J. Graph Theory, 2019
Disjoint paths in unions of tournaments.
J. Comb. Theory B, 2019
Coloring square-free Berge graphs.
J. Comb. Theory B, 2019
Induced subgraphs of graphs with large chromatic number. XI. Orientations.
Eur. J. Comb., 2019
On the Erdős-Hajnal conjecture for six-vertex tournaments.
Eur. J. Comb., 2019
Large rainbow matchings in general graphs.
Eur. J. Comb., 2019
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271).
Dagstuhl Reports, 2019
Maximum independent sets in (pyramid, even hole)-free graphs.
CoRR, 2019
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.
CoRR, 2019
Towards Erdős-Hajnal for Graphs with No 5-Hole.
Comb., 2019
Approximately Coloring Graphs Without Long Induced Paths.
Algorithmica, 2019
Avoidable Vertices and Edges in Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Four-coloring P6-free graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Complexity of C<sub>k</sub>-Coloring in Hereditary Classes of Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
3-Colorable Subclasses of P<sub>8</sub>-Free Graphs.
SIAM J. Discret. Math., 2018
Odd Holes in Bull-Free Graphs.
SIAM J. Discret. Math., 2018
A short proof of the wonderful lemma.
J. Graph Theory, 2018
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].
J. Comb. Theory B, 2018
Even pairs and prism corners in square-free Berge graphs.
J. Comb. Theory B, 2018
Domination in tournaments.
J. Comb. Theory B, 2018
Triangle-free graphs with no six-vertex induced path.
Discret. Math., 2018
Vertex-minors and the Erdős-Hajnal conjecture.
Discret. Math., 2018
Four-coloring P<sub>6</sub>-free graphs. II. Finding an excellent precoloring.
CoRR, 2018
Four-coloring Ps<sub>6</sub>-free graphs. I. Extending an excellent precoloring.
CoRR, 2018
Piercing Axis-Parallel Boxes.
Electron. J. Comb., 2018
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.
Comb., 2018
The Sandwich Problem for Decompositions and Almost Monotone Properties.
Algorithmica, 2018
2017
4-Coloring <i>P</i><sub>6</sub>-Free Graphs with No Induced 5-Cycles.
J. Graph Theory, 2017
Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs.
J. Graph Theory, 2017
Graphs with No Induced Five-Vertex Path or Antipath.
J. Graph Theory, 2017
Colouring perfect graphs with bounded clique number.
J. Comb. Theory B, 2017
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.
Comb., 2017
2016
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.
J. Comb. Theory B, 2016
Unavoidable induced subgraphs in large graphs with no homogeneous sets.
J. Comb. Theory B, 2016
Immersion in four-edge-connected graphs.
J. Comb. Theory B, 2016
Obstructions for three-coloring graphs with one forbidden induced subgraph.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Excluding a Substar and an Antisubstar.
SIAM J. Discret. Math., 2015
Coloring perfect graphs with no balanced skew-partitions.
J. Comb. Theory B, 2015
Edge-colouring eight-regular planar graphs.
J. Comb. Theory B, 2015
Edge-colouring seven-regular planar graphs.
J. Comb. Theory B, 2015
Forcing large transitive subtournaments.
J. Comb. Theory B, 2015
Cliques in the union of graphs.
J. Comb. Theory B, 2015
Wheel-free planar graphs.
Eur. J. Comb., 2015
Three-coloring graphs with no induced seven-vertex path II : using a triangle.
CoRR, 2015
A De Bruijn-Erdős Theorem for Chordal Graphs.
Electron. J. Comb., 2015
Excluding paths and antipaths.
Comb., 2015
2014
The Structure of Claw-Free Perfect Graphs.
J. Graph Theory, 2014
Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the <i>H</i><sub>6</sub>-Conjecture.
J. Graph Theory, 2014
The Erdös-Hajnal Conjecture - A Survey.
J. Graph Theory, 2014
Excluding pairs of graphs.
J. Comb. Theory B, 2014
Rao's degree sequence conjecture.
J. Comb. Theory B, 2014
Extending the Gyárfás-Sumner conjecture.
J. Comb. Theory B, 2014
Tournaments with near-linear transitive subsets.
J. Comb. Theory B, 2014
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.
CoRR, 2014
4-coloring $P_6$-free graphs with no induced 5-cycles.
CoRR, 2014
Cliques and stable sets in undirected graphs.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014
2013
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.
SIAM J. Discret. Math., 2013
A counterexample to a conjecture of Schwartz.
Soc. Choice Welf., 2013
The Structure of Bull-Free Perfect Graphs.
J. Graph Theory, 2013
Detecting an induced net subdivision.
J. Comb. Theory B, 2013
Substitution and χ-boundedness.
J. Comb. Theory B, 2013
Tournaments and colouring.
J. Comb. Theory B, 2013
Excluding four-edge paths and their complements
CoRR, 2013
Ups and downs of the 4-edge path
CoRR, 2013
2012
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
IEEE/ACM Trans. Netw., 2012
SIAM J. Discret. Math., 2012
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement.
J. Graph Theory, 2012
Excluding Induced Subdivisions of the Bull and Related Graphs.
J. Graph Theory, 2012
Claw-free graphs. VII. Quasi-line graphs.
J. Comb. Theory B, 2012
Three-colourable perfect graphs without even pairs.
J. Comb. Theory B, 2012
Tournament immersion and cutwidth.
J. Comb. Theory B, 2012
The structure of bull-free graphs II and III - A summary.
J. Comb. Theory B, 2012
The structure of bull-free graphs I - Three-edge-paths with centers and anticenters.
J. Comb. Theory B, 2012
LexBFS, structure and algorithms
CoRR, 2012
Perfect matchings in planar cubic graphs.
Comb., 2012
Finding minimum clique capacity.
Comb., 2012
2011
A well-quasi-order for tournaments.
J. Comb. Theory B, 2011
The edge-density for K<sub>2, t</sub> minors.
J. Comb. Theory B, 2011
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.
Discret. Appl. Math., 2011
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.
Discret. Appl. Math., 2011
Optimal antithickenings of claw-free trigraphs
CoRR, 2011
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs
CoRR, 2011
2010
An approximate version of Hadwiger's conjecture for claw-free graphs.
J. Graph Theory, 2010
Claw-free graphs VI. Colouring.
J. Comb. Theory B, 2010
K<sub>4</sub>-free graphs with no odd holes.
J. Comb. Theory B, 2010
The three-in-a-tree problem.
Comb., 2010
2009
Even pairs in Berge graphs.
J. Comb. Theory B, 2009
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs.
Discret. Math., 2009
2008
Detecting a Theta or a Prism.
SIAM J. Discret. Math., 2008
Hadwiger's conjecture for quasi-line graphs.
J. Graph Theory, 2008
Claw-free graphs. V. Global structure.
J. Comb. Theory B, 2008
The Erdös-Hajnal conjecture for bull-free graphs.
J. Comb. Theory B, 2008
Claw-free graphs. IV. Decomposition theorem.
J. Comb. Theory B, 2008
Claw-free graphs. III. Circular interval graphs.
J. Comb. Theory B, 2008
Claw-free graphs. II. Non-orientable prismatic graphs.
J. Comb. Theory B, 2008
Solution of three problems of Cornuéjols.
J. Comb. Theory B, 2008
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory B, 2008
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.
Discret. Appl. Math., 2008
Cycles in dense digraphs.
Comb., 2008
An algorithm for packing non-zero <i>A</i> -paths in group-labelled graphs.
Comb., 2008
2007
Coloring quasi-line graphs.
J. Graph Theory, 2007
Claw-free graphs. I. Orientable prismatic graphs.
J. Comb. Theory B, 2007
The roots of the independence polynomial of a clawfree graph.
J. Comb. Theory B, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
Packing Non-Zero A-Paths In Group-Labelled Graphs.
Comb., 2006
2005
Partial characterizations of clique-perfect graphs.
Electron. Notes Discret. Math., 2005
Recognizing Berge Graphs.
Comb., 2005
The structure of claw-free graphs.
Proceedings of the Surveys in Combinatorics, 2005
2003
Progress on perfect graphs.
Math. Program., 2003
2002
Triangulated Spheres and Colored Cliques.
Discret. Comput. Geom., 2002
