On minimal n-universal graphs
From MaRDI portal
Publication:5341592
DOI10.1017/S2040618500035139zbMath0132.21202OpenAlexW2119837203MaRDI QIDQ5341592
Publication date: 1965
Published in: Proceedings of the Glasgow Mathematical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s2040618500035139
Related Items (26)
Better distance labeling for unweighted planar graphs ⋮ Induced-universal graphs for graphs with bounded maximum degree ⋮ On Universal Graphs of Minor Closed Families ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ On Universal Threshold Graphs ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Implicit representation of relations ⋮ Unnamed Item ⋮ Optimal induced universal graphs for bounded-degree graphs ⋮ Unnamed Item ⋮ Universal caterpillars ⋮ Induced Universal Hypergraphs ⋮ Universality of random permutations ⋮ Universal arrays ⋮ Better distance labeling for unweighted planar graphs ⋮ Asymptotically optimal induced universal graphs ⋮ Constructing labeling schemes through universal matrices ⋮ On induced-universal graphs for the class of bounded-degree graphs ⋮ Universal commutator graphs ⋮ Vector representations of graphs ⋮ On graphs which contain all small trees ⋮ Lower bounds for superpatterns and universal sequences ⋮ Tractable combinations of theories via sampling ⋮ Not all graphs are segment \(T\)-graphs ⋮ Isometric Universal Graphs ⋮ UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS
This page was built for publication: On minimal n-universal graphs
