UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS

DOI10.1142/S1793830913500389zbMath1280.05089arXiv1307.6192OpenAlexW2146429887MaRDI QIDQ2874053

Alexandr Valyuzhenich, Aistis Atminas, Sergey Kitaev, Vadim V. Lozin

Publication date: 28 January 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

universal graphsbipartite permutation graphs321-avoiding permutationssplit permutation graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Bichain graphs: geometric model and universal graphs ⋮ Induced subgraphs of zero-divisor graphs

Cites Work

• Patterns in permutations and words.
• Induced-universal graphs for graphs with bounded maximum degree
• On induced-universal graphs for the class of bounded-degree graphs
• Split graphs of Dilworth number 2
• Some universal graphs
• Nonexistence of universal graphs without some trees
• Universal graphs without large bipartite subgraphs
• Universal graphs and induced-universal graphs
• Implicat Representation of Graphs
• On Universal Threshold Graphs
• On minimal n-universal graphs

This page was built for publication: UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS