A counterexample regarding labelled well-quasi-ordering

DOI10.1007/s00373-018-1962-0zbMath1402.05182arXiv1709.10042OpenAlexW2964181817WikidataQ124846948 ScholiaQ124846948MaRDI QIDQ1756107

Robert Brignall, Michael Engen, Vincent R. Vatter

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.10042

zbMATH Keywords

permutation graphwell-quasi-orderlabelled well-quasi-orderwiddershins spiral

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Labelled well-quasi-order for permutation classes ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• Boundary properties of well-quasi-ordered sets of graphs
• Well-quasi-order of relabel functions
• Labelled induced subgraphs and well-quasi-ordering
• Graph minors. I. Excluding a forest
• Split graphs of Dilworth number 2
• Forbidden subsequences
• Split permutation graphs
• Decomposing simple permutations, with enumerative consequences
• Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
• Permutation classes
• Well quasi-order in combinatorics: embeddings and homomorphisms
• Split Graphs Having Dilworth Number Two
• Graph Classes: A Survey
• Transitiv orientierbare Graphen
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• Restricted permutations

This page was built for publication: A counterexample regarding labelled well-quasi-ordering