Currently browsing: Items authored or edited by Robert Brignall https://orcid.org/0000-0002-2769-4853

Atminas, A.; Brignall, R.; Lozin, V. and Stacho, J. (2021). Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discrete Applied Mathematics, 295 pp. 57–69.

• Download Accepted Manuscript (PDF / 285kB)

Atminas, Aistis and Brignall, Robert (2020). Well-quasi-ordering and finite distinguishing number. Journal of Graph Theory, 95(1) pp. 5–26.

• Download Accepted Manuscript (PDF / 287kB)

Albert, Michael; Brignall, Robert; Ruskuc, Nik and Vatter, Vincent (2019). Rationality for subclasses of 321-avoiding permutations. European Journal of Combinatorics, 78 pp. 44–72.

• Download Accepted Manuscript (PDF / 540kB)

Albert, Michael; Atminas, Aistis and Brignall, Robert (2018). Characterising inflations of monotone grid classes of permutations. Journal of Combinatorial Theory, Series A, 154 pp. 444–463.

• Download Accepted Manuscript (PDF / 254kB)

Albert, Michael and Brignall, Robert (2016). 2×2 monotone grid classes are finitely based. Discrete Mathematics & Theoretical Computer Science, 18(2), article no. 1.

• Download Published Version (PDF / 119kB)

Atminas, Aistis; Brignall, Robert; Korpelainen, Nicholas; Lozin, Vadim and Vatter, Vincent (2015). Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electronic Journal of Combinatorics, 22(2), article no. P2.20.

• Download Published Version (PDF / 264kB)

Albert, Michael H. and Brignall, Robert (2014). Enumerating indices of Schubert varieties defined by inclusions. Journal of Combinatorial Theory, Series A, 123(1) pp. 154–168.

Albert, Michael; Brignall, Robert and Vatter, Vincent (2013). Large infinite antichains of permutations. Pure Mathematics and Applications, 24(2) pp. 47–57.

Albert, M. H.; Atkinson, M. D. and Brignall, Robert (2012). The enumeration of three pattern classes using monotone grid classes. Electronic Journal of Combinatorics, 19(3) P20.

• Download Published Version (PDF / 308kB)

Albert, M. H.; Atkinson, M. D. and Brignall, Robert (2011). The enumeration of permutations avoiding 2143 and 4231. Pure Mathematics and Applications, 22(2) pp. 87–98.

• Download Accepted Manuscript (PDF / 118kB)

Albert, M. H.; Atkinson, M. D.; Brignall, R.; Ruškuc, N.; Smith, Rebecca and West, J. (2010). Growth rates for subclasses of Av(321). Electronic Journal of Combinatorics, 17(1) R141.

• Download Published Version (PDF / 204kB)

Albert, M. H.; Atkinson, M. D. and Brignall, Robert (2007). Permutation classes of polynomial growth. Annals of Combinatorics, 11(3-4) pp. 249–264.

Brignall, Robert (2024). Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes. The Electronic Journal of Combinatorics, 31(2), article no. P2.21.

• Download Published Version (PDF / 338kB)

Bóna, Miklós; Bouvel, Mathilde; Brignall, Robert and Pantone, Jay (2024). Mini-Workshop: Permutation Patterns. Oberwolfach Reports, 21(1) pp. 273–308.

• Download Published Version (PDF / 379kB)

Brignall, Robert and Cocks, Daniel (2023). A framework for minimal hereditary classes of graphs of unbounded clique-width. SIAM Journal on Discrete Mathematics, 37(4) pp. 2558–2584.

• Download Accepted Manuscript (PDF / 389kB)

Brignall, Robert and Cocks, Daniel (2022). Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. Electronic Journal of Combinatorics, 29(1), article no. P1.63.

• Download Accepted Manuscript (PDF / 849kB)

Brignall, Robert and Vatter, Vincent (2022). Labelled well-quasi-order for permutation classes. Combinatorial Theory, 2(3)

• Download Published Version (PDF / 873kB)

Bevan, David; Brignall, Robert; Elvey Price, Andrew and Pantone, Jay (2020). A structural characterisation of Av(1324) and new bounds on its growth rate. European Journal of Combinatorics, 88, article no. 103115.

• Download Accepted Manuscript (PDF / 627kB)

Brignall, Robert and Sliacan, Jakub (2019). Combinatorial specifications for juxtapositions of permutation classes. Electronic Journal of Combinatorics, 26(4), article no. P4.4.

• Download Published Version (PDF / 363kB)

Brignall, Robert; Choi, Hojin; Jeong, Jisu and Oum, Sang-il (2019). Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. Discrete Applied Mathematics, 257 pp. 60–66.

• Download Accepted Manuscript (PDF / 303kB)

Brignall, Robert; Jelínek, Vít; Kynčl, Jan and Marchant, David (2019). Zeros of the Möbius function of permutations. Mathematika, 65(4) pp. 1074–1092.

• Download Accepted Manuscript (PDF / 411kB)

Brignall, Robert; Engen, Michael and Vatter, Vincent (2018). A Counterexample Regarding Labelled Well-Quasi-Ordering. Graphs and Combinatorics, 34(6) pp. 1395–1409.

• Download Accepted Manuscript (PDF / 435kB)

Brignall, Robert and Marchant, David William (2018). The Möbius function of permutations with an indecomposable lower bound. Discrete Mathematics, 341(5) pp. 1380–1391.

• Download Accepted Manuscript (PDF / 514kB)

Bevan, David; Brignall, Robert; Price, Andrew Elvey and Pantone, Jay (2017). Staircases, dominoes, and the growth rate of 1324-avoiders. In: Electronic Notes in Discrete Mathematics, 61 pp. 123–129.

• Download Accepted Manuscript (PDF / 110kB)

Brignall, Robert; Korpelainen, Nicholas and Vatter, Vincent (2017). Linear Clique-Width for Hereditary Classes of Cographs. Journal of Graph Theory, 84(4) pp. 501–511.

• Download Accepted Manuscript (PDF / 167kB)

Brignall, Robert and Sliacan, Jakub (2017). Juxtaposing Catalan Permutation Classes with Monotone Ones. Electronic Journal of Combinatorics, 24(2), article no. 2.11.

• Download Published Version (PDF / 301kB)

Brignall, Robert; Lozin, Vadim V. and Stacho, Juraj (2016). Bichain graphs: geometric model and universal graphs. Discrete Applied Mathematics, 199 pp. 16–29.

Brignall, Robert and Vatter, Vincent (2015). A simple proof of a theorem of Schmerl and Trotter for permutations. Journal of Combinatorics, 6(1–2) pp. 47–54.

• Download Accepted Manuscript (PDF / 93kB)

Brignall, Robert (2012). Grid classes and partial well order. Journal of Combinatorial Theory, Series A, 119(1) pp. 99–116.

• Download Accepted Manuscript (PDF / 226kB)

Brignall, Robert; Georgiou, Nicholas and Waters, Robert J. (2012). Modular decomposition and the reconstruction conjecture. Journal of Combinatorics, 3(1) pp. 123–134.

• Download Accepted Manuscript (PDF / 115kB)

Brignall, Robert; Ruškuc, Nik and Vatter, Vincent (2011). Simple extensions of combinatorial structures. Mathematika, 57(02) pp. 193–214.

• Download Accepted Manuscript (PDF / 213kB)

Brignall, Robert (2010). A survey of simple permutations. In: Linton, Steve; Ruškuc, Nik and Vatter, Vincent eds. Permutation Patterns. London Mathematical Society Lecture Notes Series (376). Cambridge, UK: Cambridge University Press, pp. 41–65.

• Download Accepted Manuscript (PDF / 205kB)

Brignall, Robert; Ekhad, Shalosh B.; Smith, Rebecca and Vatter, Vincent (2009). Almost avoiding permutations. Discrete Mathematics, 309(23-24) pp. 6626–6631.

Brignall, Robert; Huczynska, Sophie and Vatter, Vincent (2008). Decomposing simple permutations, with enumerative consequences. Combinatorica, 28(4) pp. 385–400.

Brignall, Robert; Huczynska, Sophie and Vatter, Vincent (2008). Simple permutations and algebraic generating functions. Journal of Combinatorial Theory, Series A, 115(3) pp. 423–441.

Brignall, Robert; Ruškuc, Nik and Vatter, Vincent (2008). Simple permutations: Decidability and unavoidable substructures. Theoretical Computer Science, 391(1-2) pp. 150–163.

Brignall, Robert (2007). Wreath products of permutation classes. Electronic Journal of Combinatorics, 14(1) Research Paper 46, 15 pp. (electronic).

• Published Version (PDF) This file is not available for public download