Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,General Computer Science
Reference7 articles.
1. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York (1973).
2. M. J. Colbourn and C. J. Colbourn, ?Graph isomorphisms and self-complementary graphs,? SIGACT News,10, No. 1, 25?29 (1978).
3. M. Kropar and R. C. Read, ?On the construction of the self-complementary graphs on 12 nodes,? J. Graph Theory,3, No. 2, 111?125 (1979).
4. I. A. Faradzhev, ?The determination of the complete list of self-complementary graphs with up to 12 vertices,? in: Algorithmic Investigations in Combinatorics [in Russian], Nauka, Moscow (1977), pp. 69?75.
5. G. Ringel, ?Selbstkomplementäre Graphen,? Arch. Math., No. 14, 354?358 (1963).
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献