Kristina Vuskovic

J. Comb. Theory B, 2022

Graphs with polynomially many minimal separators.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

2021

Counting Weighted Independent Sets beyond the Permanent.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Coloring rings.

[BibT_eX]

[DOI]

Irena Penev

J. Graph Theory, 2021

The (theta, wheel)-free graphs Part IV: Induced paths and cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Two classes of β-perfect graphs that do not necessarily have simplicial extremes.

[BibT_eX]

[DOI]

Jake Horsfield

Discret. Math., 2021

2020

The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The (theta, wheel)-free graphs Part II: Structure theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Hadwiger's Conjecture for some hereditary classes of graphs: a survey.

[BibT_eX]

[DOI]

Kathie Cameron

Bull. EATCS, 2020

2019

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

[BibT_eX]

[DOI]

J. Graph Theory, 2019

The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs.

[BibT_eX]

[DOI]

Valerio Boncompagni

J. Graph Theory, 2019

Clique-cutsets beyond chordal graphs.

[BibT_eX]

[DOI]

Valerio Boncompagni

Irena Penev

J. Graph Theory, 2019

Coloring square-free Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

Structure and algorithms for (cap, even hole)-free graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Murilo V. G. da Silva

Shenwei Huang

Discret. Math., 2018

2017

On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

On rank-width of even-hole-free graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs.

[BibT_eX]

[DOI]

Stéphan Thomassé

Algorithmica, 2017

2015

Coloring perfect graphs with no balanced skew-partitions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Vertex elimination orderings for hereditary graph classes.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Linear Balanceable and Subcubic Balanceable Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

A Class of Three-Colorable Triangle-Free Graphs.

[BibT_eX]

[DOI]

Murilo Vicente Gonçalves da Silva

J. Graph Theory, 2013

Decomposition of even-hole-free graphs with star cutsets and 2-joins.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Parameterized algorithm for weighted independent set problem in bull-free graphs.

[BibT_eX]

[DOI]

Stéphan Thomassé

CoRR, 2013

Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.

[BibT_eX]

[DOI]

CoRR, 2013

The world of hereditary graph classes viewed through Truemper configurations.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2013, 2013

2012

Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Detecting 2-joins faster.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Combinatorial optimization with 2-joins.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

LexBFS, structure and algorithms

[BibT_eX]

[DOI]

CoRR, 2012

2011

On Roussel-Rubio-type lemmas and their consequences.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Chromatic index of graphs with no cycle with a unique chord.

[BibT_eX]

[DOI]

Raphael C. S. Machado

Theor. Comput. Sci., 2010

A structure theorem for graphs with no cycle with a unique chord and its consequences.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

2009

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.

[BibT_eX]

[DOI]

Ton Kloks

Haiko Müller

J. Comb. Theory B, 2009

2008

Algorithms for Square-3PC(., .)-Free Berge Graphs.

[BibT_eX]

[DOI]

Murilo Vicente Gonçalves da Silva

SIAM J. Discret. Math., 2008

2007

Triangulated neighborhoods in even-hole-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Odd Hole Recognition in Graphs of Bounded Clique Size.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Balanced matrices.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Algorithms for 3PC(., .)-free Berge graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Recognizing Berge Graphs.

[BibT_eX]

[DOI]

Comb., 2005

2004

Square-free perfect graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

A Polynomial Algorithm for Recognizing Perfect Graphs.

[BibT_eX]

[DOI]

Xinming Liu

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Even-hole-free graphs part I: Decomposition theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Even-hole-free graphs part II: Recognition algorithm.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

The graph sandwich problem for 1-join composition is NP-complete.

[BibT_eX]

[DOI]

Sulamita Klein

Discret. Appl. Math., 2002

Perfect Graphs, Partitionable Graphs and Cutsets.

[BibT_eX]

[DOI]

Comb., 2002

2001

Balanced 0-1 Matrices II. Recognition Algorithm.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Balanced 0-1 Matrices I. Decomposition.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Perfect, ideal and balanced matrices.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

Recognition of quasi-Meyniel graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Triangle-free graphs that are signable without even holes.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

A class of ?-perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Even and odd holes in cap-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Balanced cycles and holes in bipartite graphs.

[BibT_eX]

[DOI]