A note on intersection dimensions of graph classes
Commentationes Mathematicae Universitatis Carolinae (1995)
- Volume: 36, Issue: 2, page 255-261
- ISSN: 0010-2628
Access Full Article
topAbstract
topHow to cite
topReferences
top- Cozzens M.B., Roberts F.S., Computing the boxicity of a graph by covering its complement by cointerval graphs, Discrete Appl. Math. 6 (1983), 217-228. (1983) Zbl0524.05059MR0712922
- Cozzens M.B., Roberts F.S., On dimensional properties of graphs, Graphs and Combinatorics 5 (1989), 29-46. (1989) Zbl0675.05054MR0981229
- Feinberg R.B., The circular dimension of a graph, Discrete Math. 25 (1979), 27-31. (1979) Zbl0392.05057MR0522744
- Golumbic M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980. Zbl1050.05002MR0562306
- Goodman J.E., Pollack R., Upper bounds for configurations and polytopes in , Discrete Computational Geometry 1 (1986), 219-227. (1986) MR0861891
- Janson S., Kratochvíl J., Thresholds for classes of intersection graphs, Discrete Math. 108 (1992), 307-326. (1992) MR1189853
- Kratochvíl J., Matoušek J., Intersection graphs of segments, J. Combin. Theory Ser. B 62 (1994), 289-315. (1994) MR1305055
- Kratochvíl J., Tuza Z., Intersection dimensions of graph classes, Graphs and Combinatorics 10 (1994), 159-168. (1994) MR1289974