Abstract
The intersection dimension of a graphG with respect to a classA of graphs is the minimumk such thatG is the intersection of at mostk graphs on vertex setV(G) each of which belongs toA. We consider the question when the intersection dimension of a certain family of graphs is bounded or unbounded. Our main results are (1) ifA is hereditary, i.e., closed on induced subgraphs, then the intersection dimension of all graphs with respect toA is unbounded, and (2) the intersection dimension of planar graphs with respect to the class of permutation graphs is bounded. We also give a simple argument based on [Ben-Arroyo Hartman, I., Newman, I., Ziv, R.:On grid intersection graphs, Discrete Math.87 (1991) 41-52] why the boxicity (i.e., the intersection dimension with respect to the class of interval graphs) of planar graphs is bounded. Further we study the relationships between intersection dimensions with respect to different classes of graphs.
Similar content being viewed by others
References
Bellantoni, S., Ben-Arroyo Hartman, I., Pazytycka, T., Whitesides, S.: Grid intersection graphs and boxicity, (preprint)
Ben-Arroyo Hartman, I., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math.87, 41–52 (1991)
Cozzens, M.B., Roberts, F.S.: Computing the boxicity of a graph by covering its complement by cointerval graphs. Discrete Appl. Math.6, 217–228 (1983)
Cozzens, M.B., Roberts, F.S.: On dimensional properties of graphs. Graphs and Combinatorics5, 29–46 (1989)
Deuber, W.: Partitionstheoreme für Graphen. Comment. Math. Helvetica50, 311–320 (1975)
Feinberg, R.B.: The circular dimension of a graph. Discrete Math.25, 27–31 (1979)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press. New York, 1980
Hliněný, P., Kuběna, ?.: in preparation
Kratochvíl, J.: k-Induced Ramsey Property and co-comparability dimension of graph classes, in preparation
Nešetřil, J., Rödi, V.: Partitions of subgraphs, In: Recent Advances in Graphs Theory (ed. M. Fiedler), Academia, Prague, 1975, pp. 413–423
Shearer, J.B.: A note on circular dimension. Discrete Math.29, 103 (1980)
Thomassen, C.: Interval representations of planar graphs. J. Comb. Theory Ser. B40, 9–20 (1986)
Trotter, W.T.: A characterization of Roberts’ inequality for boxicity. Discrete Math.28, 303–314(1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kratochvil, J., Tuza, Z. Intersection Dimensions of Graph Classes. Graphs and Combinatorics 10, 159–168 (1994). https://doi.org/10.1007/BF02986660
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02986660