Bichain graphs: geometric model and universal graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5720940 (Why is no real title available?)
- scientific article; zbMATH DE number 4193736 (Why is no real title available?)
- Approximating clique-width and branch-width
- Bandwidth of chain graphs
- Clique-width for 4-vertex forbidden subgraphs
- Difference graphs
- Independence and domination in polygon graphs
- Introduction to algorithms.
- Letter graphs and well-quasi-order by induced subgraphs
- Minimal classes of graphs of unbounded clique-width
- On Universal Threshold Graphs
- Rank-width and vertex-minors
- Split graphs of Dilworth number 2
- Split permutation graphs
- The speed of hereditary properties of graphs
- Threshold graphs and related topics
- Universal graphs and universal permutations
Cited in
(4)- Universal graphs and universal permutations
- The bilinear–biquadratic model on the complete graph
- Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
This page was built for publication: Bichain graphs: geometric model and universal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896651)
