On graphs which contain all small trees
From MaRDI portal
Publication:1245238
DOI10.1016/0095-8956(78)90072-2zbMATH Open0374.05042OpenAlexW1994115477MaRDI QIDQ1245238FDOQ1245238
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90072-2
Cites Work
- On extremal problems of graphs and generalized graphs
- Pancyclic graphs. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Cycles of even length in graphs
- Title not available (Why is that?)
- On the theory of graphs
- On minimal n-universal graphs
Cited In (17)
- Expanders Are Universal for the Class of All Spanning Trees
- Embedding nearly-spanning bounded degree trees
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
- Distance realization problems with applications to internet tomography
- Adjacency Labeling Schemes and Induced-Universal Graphs
- On unavoidable graphs
- Universal caterpillars
- Perfect Storage Representations for Families of Data Structures
- Title not available (Why is that?)
- Optimal threshold for a random graph to be 2-universal
- A note on universal graphs for spanning trees
- Supertrees
- Size Ramsey number of bounded degree graphs for games
- Universal geometric graphs
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Panarboreal graphs
- Extremal f-trees and embedding spaces for molecular graphs
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)
