Minimum difference representations of graphs
From MaRDI portal
Recommendations
- Minimal Euclidean representations of graphs
- Minimal Representation of Directed Hypergraphs
- Approximating the Minimum Equivalent Digraph
- scientific article; zbMATH DE number 1003248
- scientific article; zbMATH DE number 1962827
- Minimum-distance bounds by graph analysis
- The Minset-Poset Approach to Representations of Graph Connectivity
- scientific article; zbMATH DE number 969977
- Graph minor theory
- Graphs as \(r\)-minoes
Cites work
- A jump to the Bell number for hereditary graph properties
- A sharp edge bound on the interval number of a graph
- Difference graphs
- Disjoint representability of sets and their complements
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs
- On a product dimension of graphs
- The Bar Visibility Number of a Graph
- The unlabelled speed of a hereditary graph property
- Unavoidable traces of set systems
Cited in
(7)- scientific article; zbMATH DE number 1670673 (Why is no real title available?)
- Kneser ranks of random graphs and minimum difference representations
- Kneser ranks of random graphs and minimum difference representations
- Minimum gradation in greyscales of graphs
- Minimal Euclidean representations of graphs
- The Minset-Poset Approach to Representations of Graph Connectivity
- Set intersection representations for almost all graphs
This page was built for publication: Minimum difference representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968207)
