Superpatterns and Universal Point Sets

DOI10.7155/jgaa.00318zbMath1290.05142arXiv1308.0403OpenAlexW2091514779MaRDI QIDQ5417595

Michael J. Bannister, William E. Devanny, David Eppstein, Zhanpeng Cheng

Publication date: 22 May 2014

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

permutation patternsforbidden patterns

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Universal layered permutations ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ A Note on Universal Point Sets for Planar Graphs ⋮ A note on universal point sets for planar graphs ⋮ Containing All Permutations ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Every collinear set in a planar graph is free

This page was built for publication: Superpatterns and Universal Point Sets