Robert Brignall

Electron. J. Comb., 2024

2023

A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width.

[BibT_eX]

[DOI]

Daniel Cocks

SIAM J. Discret. Math., December, 2023

2022

Labelled well-quasi-order for permutation classes.

[BibT_eX]

[DOI]

Comb. Theory, 2022

Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width.

[BibT_eX]

[DOI]

Daniel Cocks

Electron. J. Comb., 2022

2021

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Well-quasi-ordering and finite distinguishing number.

[BibT_eX]

[DOI]

Aistis Atminas

J. Graph Theory, 2020

A structural characterisation of Av(1324) and new bounds on its growth rate.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

2019

Rationality for subclasses of 321-avoiding permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Combinatorial Specifications for Juxtapositions of Permutation Classes.

[BibT_eX]

[DOI]

Jakub Sliacan

Electron. J. Comb., 2019

2018

Characterising inflations of monotone grid classes of permutations.

[BibT_eX]

[DOI]

Aistis Atminas

J. Comb. Theory A, 2018

A Counterexample Regarding Labelled Well-Quasi-Ordering.

[BibT_eX]

[DOI]

Michael Engen

Graphs Comb., 2018

The Möbius function of permutations with an indecomposable lower bound.

[BibT_eX]

[DOI]

David Marchant

Discret. Math., 2018

2017

Linear Clique-Width for Hereditary Classes of Cographs.

[BibT_eX]

[DOI]

Nicholas Korpelainen

J. Graph Theory, 2017

Staircases, dominoes, and the growth rate of 1324-avoiders.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Juxtaposing Catalan Permutation Classes with Monotone Ones.

[BibT_eX]

[DOI]

Jakub Sliacan

Electron. J. Comb., 2017

2016

2×2 monotone grid classes are finitely based.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Bichain graphs: Geometric model and universal graphs.

[BibT_eX]

[DOI]

Vadim V. Lozin

Juraj Stacho

Discret. Appl. Math., 2016

2015

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.

[BibT_eX]

[DOI]

CoRR, 2015

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Enumerating indices of Schubert varieties defined by inclusions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

2012

Grid classes and partial well order.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

The Enumeration of Three Pattern Classes using Monotone Grid Classes.

[BibT_eX]

[DOI]

Mike D. Atkinson

Electron. J. Comb., 2012

2010

Growth Rates for Subclasses of Av(321).

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Almost avoiding permutations.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Simple permutations: Decidability and unavoidable substructures.

[BibT_eX]

[DOI]

Nikola Ruskuc

Theor. Comput. Sci., 2008

Simple permutations and algebraic generating functions.

[BibT_eX]

[DOI]

Sophie Huczynska

J. Comb. Theory A, 2008

Decomposing simple permutations, with enumerative consequences.

[BibT_eX]

[DOI]

Sophie Huczynska

Comb., 2008

2007

Wreath Products of Permutation Classes.

[BibT_eX]

[DOI]