Maria Chudnovsky

Ilya Maier

CoRR, February, 2026

The Structure of Metrizable Graphs.

[BibT_eX]

[DOI]

Daniel Cizma

Nati Linial

Discret. Comput. Geom., January, 2026

Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors.

[BibT_eX]

[DOI]

Sepehr Hajebi

J. Comb. Theory B, 2026

Tree independence number II. Three-path-configurations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2026

Reuniting χ-boundedness with polynomial χ-boundedness.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2026

The Vertex Sets of Subtrees of a Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2026

2025

Dominated balanced separators in wheel-induced-minor-free graphs.

[BibT_eX]

[DOI]

CoRR, December, 2025

Tree-independence number VI. Thetas and pyramids.

[BibT_eX]

[DOI]

Julien Codsi

CoRR, September, 2025

A simple layered-wheel-like construction.

[BibT_eX]

[DOI]

CoRR, July, 2025

Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041).

[BibT_eX]

[DOI]

Dagstuhl Reports, January, 2025

Tree independence number V. Walls and claws.

[BibT_eX]

[DOI]

CoRR, January, 2025

Unavoidable Induced Subgraphs in Graphs with Complete Bipartite Induced Minors.

[BibT_eX]

[DOI]

Sebastian Wiederrecht

SIAM J. Discret. Math., 2025

Submodular Functions and Perfect Graphs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2025

Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole.

[BibT_eX]

[DOI]

Sepehr Hajebi

Eur. J. Comb., 2025

Even pairs in Berge graphs with no balanced skew-partitions.

[BibT_eX]

[DOI]

Tara Abrishami

Yaqian Tang

Discret. Math., 2025

Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets.

[BibT_eX]

[DOI]

Discret. Math., 2025

Counting independent sets in structured graphs.

[BibT_eX]

[DOI]

Matija Bucic

Julien Codsi

Comb. Probab. Comput., 2025

Tree Independence Number IV. Even-hole-free graphs.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

String Graph Obstacles of High Girth and of Bounded Degree.

[BibT_eX]

[DOI]

David Eppstein

David Fischer

Proceedings of the 33rd International Symposium on Graph Drawing and Network Visualization, 2025

2024

List-k-Coloring H-Free Graphs for All k>4.

[BibT_eX]

[DOI]

Sepehr Hajebi

Comb., October, 2024

Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.

[BibT_eX]

[DOI]

Comb., October, 2024

Induced subgraphs and tree decompositions V. one neighbor in a hole.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2024

Cops and Robbers on $\boldsymbol{P_5}$-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Four-Coloring $\boldsymbol{P_6}$-Free Graphs. II. Finding an Excellent Precoloring.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

Characterizing and generalizing cycle completable graphs.

[BibT_eX]

[DOI]

Ian M. J. McInnis

Discret. Math., February, 2024

Bipartite graphs with no K6 minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.

[BibT_eX]

[DOI]

Eur. J. Comb., January, 2024

Tree independence number I. (Even hole, diamond, pyramid)-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Graphs with no even holes and no sector wheels are the union of two chordal graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Colouring t-perfect graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Sparse induced subgraphs in P7-free graphs of bounded clique number.

[BibT_eX]

[DOI]

CoRR, 2024

Max Weight Independent Set in Sparse Graphs with No Long Claws.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Sparse induced subgraphs in P6-free graphs.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Polynomial bounds for chromatic number VII. Disjoint holes.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Strengthening Rödl's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, November, 2023

Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Proof of a conjecture of Plummer and Zha.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Even-hole-free graphs still have bisimplicial vertices.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Complexity of Ck-coloring in hereditary classes of graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Polynomial bounds for chromatic number VI. Adding a four-vertex path.

[BibT_eX]

[DOI]

Eur. J. Comb., May, 2023

Stable sets in flag spheres.

[BibT_eX]

[DOI]

Eran Nevo

Eur. J. Comb., May, 2023

Sparse induced subgraphs in P_6-free graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Cops and robbers on P5-free graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).

[BibT_eX]

[DOI]

Dagstuhl Reports, November, 2022

Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree.

[BibT_eX]

[DOI]

Tara Abrishami

Kristina Vuskovic

J. Comb. Theory B, 2022

Graphs with polynomially many minimal separators.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Tournaments and the strong Erdős-Hajnal Property.

[BibT_eX]

[DOI]

Shira Zerbib

Eur. J. Comb., 2022

Avoidable vertices and edges in graphs: Existence, characterization, and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Concatenating Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Rainbow Paths and Large Rainbow Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Theor. Comput. Sci., 2021

Finding a Shortest Odd Hole.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Strongly perfect claw-free graphs - A short proof.

[BibT_eX]

[DOI]

Cemil Dibek

J. Graph Theory, 2021

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Erdős-Hajnal for cap-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

A note on simplicial cliques.

[BibT_eX]

[DOI]

Discret. Math., 2021

New examples of minimal non-strongly-perfect graphs.

[BibT_eX]

[DOI]

Cemil Dibek

Discret. Math., 2021

Square-Free Graphs with no Induced Fork.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Pure Pairs. II. Excluding All Subdivisions of A Graph.

[BibT_eX]

[DOI]

Comb., 2021

Detecting a Long Odd Hole.

[BibT_eX]

[DOI]

Comb., 2021

List 3-Coloring Graphs with No Induced P6+rP3.

[BibT_eX]

[DOI]

Algorithmica, 2021

Induced subgraphs of bounded treewidth and the container method.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Coloring graphs with no induced five-vertex path or gem.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Corrigendum to "Bisimplicial vertices in even-hole-free graphs".

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Induced equators in flag spheres.

[BibT_eX]

[DOI]

Eran Nevo

J. Comb. Theory A, 2020

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Obstructions for three-coloring graphs without induced paths on six vertices.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Detecting an Odd Hole.

[BibT_eX]

[DOI]

J. ACM, 2020

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

Discret. Math., 2020

Excluding the fork and antifork.

[BibT_eX]

[DOI]

Linda Cook

Discret. Math., 2020

List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

CoRR, 2020

Cooperative Colorings of Trees and of Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Perfect divisibility and 2-divisibility.

[BibT_eX]

[DOI]

Vaidy Sivaraman

J. Graph Theory, 2019

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Induced subgraphs of graphs with large chromatic number. XII. Distant stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Disjoint paths in unions of tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Coloring square-free Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Induced subgraphs of graphs with large chromatic number. XI. Orientations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

On the Erdős-Hajnal conjecture for six-vertex tournaments.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Large rainbow matchings in general graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271).

[BibT_eX]

[DOI]

Daniël Paulusma

Oliver Schaudt

Dagstuhl Reports, 2019

Maximum independent sets in (pyramid, even hole)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Towards Erdős-Hajnal for Graphs with No 5-Hole.

[BibT_eX]

[DOI]

Comb., 2019

Avoidable Vertices and Edges in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Four-coloring P6-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Complexity of Ck-Coloring in Hereditary Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

3-Colorable Subclasses of P8-Free Graphs.

[BibT_eX]

[DOI]

Juraj Stacho

SIAM J. Discret. Math., 2018

Odd Holes in Bull-Free Graphs.

[BibT_eX]

[DOI]

Vaidy Sivaraman

SIAM J. Discret. Math., 2018

A short proof of the wonderful lemma.

[BibT_eX]

[DOI]

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].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Even pairs and prism corners in square-free Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Domination in tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Triangle-free graphs with no six-vertex induced path.

[BibT_eX]

[DOI]

Discret. Math., 2018

Vertex-minors and the Erdős-Hajnal conjecture.

[BibT_eX]

[DOI]

Sang-il Oum

Discret. Math., 2018

Four-coloring P6-free graphs. II. Finding an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Four-coloring Ps6-free graphs. I. Extending an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Piercing Axis-Parallel Boxes.

[BibT_eX]

[DOI]

Shira Zerbib

Electron. J. Comb., 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.

[BibT_eX]

[DOI]

Comb., 2018

The Sandwich Problem for Decompositions and Almost Monotone Properties.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Algorithmica, 2018

2017

4-Coloring P6-Free Graphs with No Induced 5-Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs.

[BibT_eX]

[DOI]

Irene Lo

J. Graph Theory, 2017

Graphs with No Induced Five-Vertex Path or Antipath.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Colouring perfect graphs with bounded clique number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.

[BibT_eX]

[DOI]

Comb., 2017

Approximately Coloring Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Unavoidable induced subgraphs in large graphs with no homogeneous sets.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Bipartite minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Disjoint dijoins.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Immersion in four-edge-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Obstructions for three-coloring graphs with one forbidden induced subgraph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Excluding a Substar and an Antisubstar.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Coloring perfect graphs with no balanced skew-partitions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Edge-colouring eight-regular planar graphs.

[BibT_eX]

[DOI]

Katherine Edwards

J. Comb. Theory B, 2015

Edge-colouring seven-regular planar graphs.

[BibT_eX]

[DOI]

Katherine Edwards

Ken-ichi Kawarabayashi

J. Comb. Theory B, 2015

Forcing large transitive subtournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Cliques in the union of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Wheel-free planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Three-coloring graphs with no induced seven-vertex path II : using a triangle.

[BibT_eX]

[DOI]

CoRR, 2015

A De Bruijn-Erdős Theorem for Chordal Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Excluding paths and antipaths.

[BibT_eX]

[DOI]

Comb., 2015

2014

The Structure of Claw-Free Perfect Graphs.

[BibT_eX]

[DOI]

Matthieu Plumettaz

J. Graph Theory, 2014

Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the H6-Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

The Erdös-Hajnal Conjecture - A Survey.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Excluding pairs of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Rao's degree sequence conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Extending the Gyárfás-Sumner conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Tournaments with near-linear transitive subsets.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.

[BibT_eX]

[DOI]

CoRR, 2014

4-coloring $P_6$-free graphs with no induced 5-cycles.

[BibT_eX]

[DOI]

CoRR, 2014

Cliques and stable sets in undirected graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A counterexample to a conjecture of Schwartz.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2013

The Structure of Bull-Free Perfect Graphs.

[BibT_eX]

[DOI]

Irena Penev

J. Graph Theory, 2013

Detecting an induced net subdivision.

[BibT_eX]

[DOI]

Nicolas Trotignon

J. Comb. Theory B, 2013

Substitution and χ-boundedness.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Tournaments and colouring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Excluding four-edge paths and their complements

[BibT_eX]

[DOI]

Irena Penev

CoRR, 2013

Ups and downs of the 4-edge path

[BibT_eX]

[DOI]

CoRR, 2013

Lines in hypergraphs.

[BibT_eX]

[DOI]

Comb., 2013

2012

Growing Without Cloning.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yori Zwols

J. Graph Theory, 2012

Excluding Induced Subdivisions of the Bull and Related Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Claw-free graphs. VII. Quasi-line graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Three-colourable perfect graphs without even pairs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Tournament immersion and cutwidth.

[BibT_eX]

[DOI]

Alexandra Ovetsky Fradkin

J. Comb. Theory B, 2012

The structure of bull-free graphs II and III - A summary.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

The structure of bull-free graphs I - Three-edge-paths with centers and anticenters.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

LexBFS, structure and algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Perfect matchings in planar cubic graphs.

[BibT_eX]

[DOI]

Comb., 2012

Packing seagulls.

[BibT_eX]

[DOI]

Comb., 2012

Finding minimum clique capacity.

[BibT_eX]

[DOI]

Sang-il Oum

Comb., 2012

2011

A well-quasi-order for tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

The edge-density for K2, t minors.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Comb. Theory B, 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.

[BibT_eX]

[DOI]

Bernard Ries

Yori Zwols

Discret. Appl. Math., 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.

[BibT_eX]

[DOI]

Bernard Ries

Yori Zwols

Discret. Appl. Math., 2011

Optimal antithickenings of claw-free trigraphs

[BibT_eX]

[DOI]

Andrew D. King

CoRR, 2011

A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs

[BibT_eX]

[DOI]

CoRR, 2011

2010

An approximate version of Hadwiger's conjecture for claw-free graphs.

[BibT_eX]

[DOI]

Alexandra Ovetsky Fradkin

J. Graph Theory, 2010

Claw-free graphs VI. Colouring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

K4-free graphs with no odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

The three-in-a-tree problem.

[BibT_eX]

[DOI]

Comb., 2010

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM workshop on Wireless of the students, 2010

2009

Even pairs in Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Discret. Math., 2009

2008

Detecting a Theta or a Prism.

[BibT_eX]

[DOI]

Rohan Kapadia

SIAM J. Discret. Math., 2008

Hadwiger's conjecture for quasi-line graphs.

[BibT_eX]

[DOI]

Alexandra Ovetsky Fradkin

J. Graph Theory, 2008

Claw-free graphs. V. Global structure.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

The Erdös-Hajnal conjecture for bull-free graphs.

[BibT_eX]

[DOI]

Shmuel Safra

J. Comb. Theory B, 2008

Claw-free graphs. IV. Decomposition theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Claw-free graphs. III. Circular interval graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Claw-free graphs. II. Non-orientable prismatic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Solution of three problems of Cornuéjols.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Bisimplicial vertices in even-hole-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Discret. Appl. Math., 2008

Cycles in dense digraphs.

[BibT_eX]

[DOI]

Blair D. Sullivan

Comb., 2008

An algorithm for packing non-zero A -paths in group-labelled graphs.

[BibT_eX]

[DOI]

William H. Cunningham

Jim Geelen

Comb., 2008

2007

Coloring quasi-line graphs.

[BibT_eX]

[DOI]

Alexandra Ovetsky

J. Graph Theory, 2007

Claw-free graphs. I. Orientable prismatic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

The roots of the independence polynomial of a clawfree graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Testing for a theta.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Berge trigraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Packing Non-Zero A-Paths In Group-Labelled Graphs.

[BibT_eX]

[DOI]

Comb., 2006

2005

Detecting even holes.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

J. Graph Theory, 2005

Partial characterizations of clique-perfect graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Electron. Notes Discret. Math., 2005

Recognizing Berge Graphs.

[BibT_eX]

[DOI]

Comb., 2005

The structure of claw-free graphs.

[BibT_eX]

Proceedings of the Surveys in Combinatorics, 2005

2003

Progress on perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2003

2002

Triangulated Spheres and Colored Cliques.

[BibT_eX]

[DOI]

Ron Aharoni