Minimum difference representations of graphs
From MaRDI portal
Publication:968207
DOI10.1007/S00373-010-0875-3zbMATH Open1203.05105OpenAlexW2022699002MaRDI QIDQ968207FDOQ968207
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0875-3
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
Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Extremal set theory (05D05)
Cites Work
- On a product dimension of graphs
- Unavoidable traces of set systems
- A jump to the Bell number for hereditary graph properties
- The unlabelled speed of a hereditary graph property
- Disjoint representability of sets and their complements
- The Bar Visibility Number of a Graph
- A sharp edge bound on the interval number of a graph
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs
- Difference graphs
Cited In (7)
- Title not available (Why is that?)
- Kneser ranks of random graphs and minimum difference representations
- Minimum gradation in greyscales of graphs
- Kneser Ranks of Random Graphs and Minimum Difference Representations
- The Minset-Poset Approach to Representations of Graph Connectivity
- Minimal Euclidean representations of graphs
- 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)
