Latest staff publications > Displaying [1–20 of 40]
Brignall, R. and Vatter, V., 2026, ‘Digit Party: Three Years of Lying About High Scores’, Math Horizons (In Press)., https://oro.open.ac.uk/110418/.
Bevan, D., Brignall, R. and Ruškuc, N., 2026, ‘On cycles in monotone grid classes of permutations’, Combinatorial Theory, 6(2), https://oro.open.ac.uk/108527/.
Brignall, R. and Vatter, V., 2026, ‘Uncountably many enumerations of well-quasi-ordered permutation classes’, Combinatorial Theory, 6(1), https://oro.open.ac.uk/106561/.
Bóna, M., Bouvel, M., Brignall, R. and Pantone, J., 2024, ‘Mini-Workshop: Permutation Patterns’, Oberwolfach Reports, 21(1), pp. 273–308., https://oro.open.ac.uk/100279/.
Brignall, R., 2024, ‘Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes’, The Electronic Journal of Combinatorics, 31(2), https://oro.open.ac.uk/97245/.
Brignall, R. and Cocks, D., 2023, ‘A framework for minimal hereditary classes of graphs of unbounded clique-width’, SIAM Journal on Discrete Mathematics, 37(4), pp. 2558–2584., https://oro.open.ac.uk/92525/.
Brignall, R. and Cocks, D., 2022, ‘Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width’, Electronic Journal of Combinatorics, 29(1), https://oro.open.ac.uk/82488/.
Brignall, R. and Vatter, V., 2022, ‘Labelled well-quasi-order for permutation classes’, Combinatorial Theory, 2(3), https://oro.open.ac.uk/85232/.
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., https://oro.open.ac.uk/75508/.
Atminas, A. and Brignall, R., 2020, ‘Well-quasi-ordering and finite distinguishing number’, Journal of Graph Theory, 95(1), pp. 5–26., https://oro.open.ac.uk/68077/.
Bevan, D., Brignall, R., Elvey Price, A. and Pantone, J., 2020, ‘A structural characterisation of Av(1324) and new bounds on its growth rate’, European Journal of Combinatorics, 88, https://oro.open.ac.uk/68534/.
Brignall, R. and Sliacan, J., 2019, ‘Combinatorial specifications for juxtapositions of permutation classes’, Electronic Journal of Combinatorics, 26(4), https://oro.open.ac.uk/67638/.
Albert, M., Brignall, R., Ruskuc, N. and Vatter, V., 2019, ‘Rationality for subclasses of 321-avoiding permutations’, European Journal of Combinatorics, 78 pp. 44–72., https://oro.open.ac.uk/59056/.
Brignall, R., Choi, H., Jeong, J. and Oum, S., 2019, ‘Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs’, Discrete Applied Mathematics, 257 pp. 60–66., https://oro.open.ac.uk/57718/.
Brignall, R., Jelínek, V., Kynčl, J. and Marchant, D., 2019, ‘Zeros of the Möbius function of permutations’, Mathematika, 65(4), pp. 1074–1092., https://oro.open.ac.uk/66369/.
Brignall, R., Engen, M. and Vatter, V., 2018, ‘A Counterexample Regarding Labelled Well-Quasi-Ordering’, Graphs and Combinatorics, 34(6), pp. 1395–1409., https://oro.open.ac.uk/56865/.
Albert, M., Atminas, A. and Brignall, R., 2018, ‘Characterising inflations of monotone grid classes of permutations’, Journal of Combinatorial Theory, Series A, 154 pp. 444–463., https://oro.open.ac.uk/51209/.
Brignall, R. and Marchant, D. W., 2018, ‘The Möbius function of permutations with an indecomposable lower bound’, Discrete Mathematics, 341(5), pp. 1380–1391., https://oro.open.ac.uk/53957/.
Bevan, D., Brignall, R., Price, A. E. and Pantone, J., 2017, ‘Staircases, dominoes, and the growth rate of 1324-avoiders’, in The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 28 - - Sep 1 2017, Vienna., https://oro.open.ac.uk/50417/.
Brignall, R., Korpelainen, N. and Vatter, V., 2017, ‘Linear Clique-Width for Hereditary Classes of Cographs’, Journal of Graph Theory, 84(4), pp. 501–511., https://oro.open.ac.uk/48647/.
