
doi: 10.1007/bf02986660
``The intersection dimension of a graph \(G\) with respect to a class \(A\) of graphs is the minimum \(k\) such that \(G\) is the intersection of at most \(k\) graphs on vertex set \(V(G)\) each of which belongs to \(A\). We consider the question when the intersection dimension of a certain family of graphs is bounded or unbounded.'' If \(A\) is hereditary and does not contain all graphs, then the intersection dimension of all graphs with respect to \(A\) is unbounded. The intersection dimension of planar graphs with respect to permutation graphs is bounded.
Graph theory, intersection graph, permutation graphs, Generalized Ramsey theory, intersection dimension, planar graphs, Planar graphs; geometric and topological aspects of graph theory
Graph theory, intersection graph, permutation graphs, Generalized Ramsey theory, intersection dimension, planar graphs, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
