|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2001, Volume 8, Issue 4, Pages 54–67
(Mi da231)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
For what $k$ in almost every $n$-vertex graph do there exist all nonisomorphic $k$-vertex subgraphs?
A. D. Korshunov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Received: 28.02.2001 Revised: 25.09.2001
Citation:
A. D. Korshunov, “For what $k$ in almost every $n$-vertex graph do there exist all nonisomorphic $k$-vertex subgraphs?”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001), 54–67
Linking options:
https://www.mathnet.ru/eng/da231 https://www.mathnet.ru/eng/da/v8/s1/i4/p54
|
Statistics & downloads: |
Abstract page: | 212 | Full-text PDF : | 95 |
|