Previous |  Up |  Next

Article

References:
[AB] N. Alon, B. Bollobas: Graphs with a small number of distinct induced subgraphs. Discrete Mathematics 75 (1989), 23–30. DOI 10.1016/0012-365X(89)90074-5 | MR 1001382
[AFL] N. Alon, P. Frankl, L. Lovasz: The chromatic number of Kneser hypergraphs. Trans. Amer. Math. Soc. 298 (1986), 359–370. DOI 10.1090/S0002-9947-1986-0857448-8 | MR 0857448
[B] B. Bollobas: Extremal Graph Theory. Academic Press, New York, 1978. MR 0506522 | Zbl 0419.05031
[BE] L. W. Beineke: Derived graphs and diagraphs. Beitrage zur Graphentheorie, H. Sachs, H. Voss, H. Walther (eds.), Teubner, Leipzig, 1968, pp. 17–33. MR 0241305
[CG] F. R. K. Chung, R. L. Graham: On graphs not containing prescribed induced subgraphs. A tribute to Paul Erdös, A. Baker, B. Bollobas, A. Hajnal (eds.), Cambridge University Press, 1991, pp. 111–120. MR 1117008
[EH] P. Erdös, A. Hajnal: On the number of induced subgraphs of a graph. Discrete Mathematics 75 (1989), 145–154. DOI 10.1016/0012-365X(89)90085-X | MR 1001393
[H] F. Harary: Graph Theory. Addison-Wesley, 1972. MR 0256911
[KM] P. Kelly, D. Merriell: A class of graphs. Trans. Amer. Math. Soc. 96 (1960), 488–492. DOI 10.1090/S0002-9947-1960-0115932-0 | MR 0115932
Partner of
EuDML logo