[1] Cozzens M.B., Roberts F.S.:
On dimensional properties of graphs. Graphs and Combinatorics 5 (1989), 29-46.
MR 0981229 |
Zbl 0675.05054
[4] Golumbic M.C.:
Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
MR 0562306 |
Zbl 1050.05002
[5] Hliněný P., Kuběna A.:
A note on intersection dimensions of graph classes. Commentationes Math. Univ. Carolinae 36 (1995).
MR 1357527
[6] Jansen S., Kratochvíl J.:
Thresholds for classes of intersection graphs. Discrete Math. 108 (1992), 307-326.
MR 1189853
[7] Koebe M.:
On a new class of intersection graphs. in: Graphs and Complexity (M. Fiedler and J. Nešetřil, eds.), Annals of Discrete Math. 51, North Holland, Amsterdam, 1992 (Proceedings 4th Czechoslovak Symposium on Combinatorics, Prachatice 1990), pp. 141-143.
MR 1206256 |
Zbl 0767.05079
[8] Kratochvíl J., Tuza Zs.:
Intersection dimensions of graph classes. Graphs and Combinatorics 10 (1994), 159-168.
MR 1289974
[9] Nešetřil J., Rödl V.:
Partitions of subgraphs. in: Recent Advances in Graphs Theory (ed. M. Fiedler), Academia, Prague, 1975, pp. 413-423.
MR 0429655
[10] Nešetřil J., Rödl V.:
Products of graphs and their apllications. in: Proceedings of the Kuratowski Conference, Lagow (eds. M. Borowiecki, J.W. Kennedy and M.M. Syslo), Lecture Notes in Mathematics (Springer Verlag) 1018 (1983), 151-160.
MR 0730645
[11] Rödl V.: A generalization of Ramsey theorem. in: Graphs, Hypergraphs and Block Systems (eds. M. Borowiecki, Z. Skupien and L. Szamkolowicz), Zielona Gora, 1976, pp. 211-220.
[13] Thomassen C.:
Interval representations of planar graphs. J. Combin. Th. Ser. B 40 (1986), 9-20.
MR 0830590 |
Zbl 0595.05027
[14] Trotter W.T.:
A characterization of Roberts' inequality for boxicity. Discrete Math. 28 (1979), 303-314.
MR 0548629