Bichain graphs: geometric model and universal graphs

DOI10.1016/j.dam.2014.08.031zbMath1326.05119OpenAlexW2139902484MaRDI QIDQ896651

Robert Brignall, Juraj Stacho, Vadim V. Lozin

Publication date: 10 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.031

zbMATH Keywords

intersection graphuniversal graphsplit permutation graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bandwidth of chain graphs
• Minimal classes of graphs of unbounded clique-width
• Independence and domination in polygon graphs
• Split graphs of Dilworth number 2
• Letter graphs and well-quasi-order by induced subgraphs
• The speed of hereditary properties of graphs
• Threshold graphs and related topics
• Split permutation graphs
• Clique-width for 4-vertex forbidden subgraphs
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS
• On Universal Threshold Graphs
• Difference graphs

This page was built for publication: Bichain graphs: geometric model and universal graphs