Recommendations
Cites work
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- Covering graphs by the minimum number of equivalence relations
- On a product dimension of graphs
- On the dimensions of ordered sets of bounded degree
- Orthogonal partitions and covering of graphs
- Probability Inequalities for Sums of Bounded Random Variables
- The Representation of a Graph by Set Intersections
Cited in
(22)- On set intersection representations of graphs
- Product dimension of forests and bounded treewidth graphs
- Bounded-depth succinct encodings and the structure they imply on graphs
- The dimension of sums of graphs
- Compact graphings
- Kneser ranks of random graphs and minimum difference representations
- Kneser ranks of random graphs and minimum difference representations
- Characterizing Graphs of Small Carving-Width
- On economical set representations of graphs
- Some results and problems on clique coverings of hypergraphs
- The dimension of sums of graphs
- Intersection dimension and maximum degree
- Intersection dimension and graph invariants
- Graph Stories in Small Area
- scientific article; zbMATH DE number 3970801 (Why is no real title available?)
- Thin strip graphs
- On a product dimension of bipartite graphs
- The dimension of graphs with respect to the direct powers of a two-element graph
- Graphs with small book thickness
- On dimensional properties of graphs
- Constant tolerance intersection graphs of subtrees of a tree
- On induced and isometric embeddings of graphs into the strong product of paths
This page was built for publication: Graphs of small dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912752)