scientific article; zbMATH DE number 3750997
From MaRDI portal
Publication:3934429
Cited in
(12)- NP-complete problems simplified on tree schemas
- Universal caterpillars
- Distance realization problems with applications to internet tomography
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Objective functions with redundant domains
- Explicit sparse almost-universal graphs for G (n, kn)
- Adjacency labeling schemes and induced-universal graphs
- Optimal threshold for a random graph to be 2-universal
- Expanders are universal for the class of all spanning trees
- Universal and unavoidable graphs
- A note on universal graphs for spanning trees
- Induced-universal graphs for graphs with bounded maximum degree
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 Q3934429)