On graphs which contain all small trees
From MaRDI portal
Publication:1245238
Cites work
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Cycles of even length in graphs
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- On minimal n-universal graphs
- On the theory of graphs
- Pancyclic graphs. I
Cited in
(17)- Panarboreal graphs
- A note on universal graphs for spanning trees
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Extremal f-trees and embedding spaces for molecular graphs
- Perfect Storage Representations for Families of Data Structures
- Universal geometric graphs
- Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)
- Supertrees
- Distance realization problems with applications to internet tomography
- Embedding nearly-spanning bounded degree trees
- Expanders are universal for the class of all spanning trees
- Adjacency labeling schemes and induced-universal graphs
- Size Ramsey number of bounded degree graphs for games
- Optimal threshold for a random graph to be 2-universal
- Universal caterpillars
- On unavoidable graphs
- Expanders Are Universal for the Class of All Spanning Trees
This page was built for publication: On graphs which contain all small trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245238)