scientific article; zbMATH DE number 5720940
From MaRDI portal
Publication:3568753
Recommendations
- Universal graphs without large bipartite subgraphs
- Minimal biconnected graphs
- Minimum \(k\)-critical bipartite graphs
- Topological minors in bipartite graphs
- scientific article; zbMATH DE number 1792660
- Universal graphs for two graph properties.
- On minimal energy of bipartite unicyclic graphs of a given bipartition.
- On bipartite graphs with minimal energy
- On the structure of minimally \(n\)-extendable bipartite graphs
- Characterizing minimally \(n\)-extendable bipartite graphs
Cited in
(26)- Tractable combinations of theories via sampling
- Hereditary classes of graphs: a parametric approach
- Near-optimal induced universal graphs for cycles and paths
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Universal graphs and universal permutations
- Bipartite induced subgraphs and well-quasi-ordering
- Universal graphs for two graph properties.
- Adjacency labeling schemes and induced-universal graphs
- Induced universal hypergraphs
- Labelled well-quasi-order for permutation classes
- Asymptotically optimal induced universal graphs
- On universal graphs of minor closed families
- On low rank-width colorings
- Combinatorics and algorithms for quasi-chain graphs
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Combinatorics and algorithms for quasi-chain graphs
- Critical properties of bipartite permutation graphs
- Graph parameters, implicit representations and factorial properties
- Canonical antichains of unit interval and bipartite permutation graphs
- Hereditary classes of ordered sets of width at most two
- Minimal classes of graphs of unbounded clique-width
- Minimal prime ages, words and permutation graphs
- Tight bounds for hypercube minor-universality
- Bichain graphs: geometric model and universal graphs
- Recent developments on graphs of bounded clique-width
- Constructing labeling schemes through universal matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568753)
