Publisher
Springer International Publishing
Reference50 articles.
1. V.E. Alekseev, Hereditary classes and coding of graphs. Problemy Kibernet. 39, 151–164 (1982). MR 694829 (85a:05071)
2. V.E. Alekseev, Range of values of entropy of hereditary classes of graphs. Diskret. Mat. 4(2), 148–157 (1992). MR 1181539 (93k:05140)
3. N. Alon, Testing subgraphs in large graphs. Random Struct. Algorithm 21(3–4), 359–370 (2002). Random structures and algorithms (Poznan, 2001). MR 1945375 (2003k:05129)
4. N. Alon, U. Stav, The maximum edit distance from hereditary graph properties. J. Comb. Theory Ser. B 98(4), 672–697 (2008). MR 2418765 (2009d:05111)
5. N. Alon, U. Stav, What is the furthest graph from a hereditary property? Random Struct. Algorithm 33(1), 87–104 (2008). MR 2428979 (2009c:05219)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献