Author:
Ueno Makoto,Tazawa Shinsei
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Bhave N.S., Raghunathan T.T.: Enumeration of bipartite self-complementary graphs. Ind. J. Pure Appl. Math. 28, 1451–1459 (1997)
2. De Bruijn N.G.: Generalization of Pólya’s fundamental theorem in enumerative combinatorial analysis. Indagat. Math. 21, 59–69 (1959)
3. Harary F., Palmer E.M.: Graphical Enumeration. Academic Press, New York/London (1973)
4. Nakamoto A., Shirakura T., Tazawa S.: An alternative enumeration of self-complementary graphs. Utilitas Mathematica 80, 25–32 (2009)
5. Pólya G.: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68, 145–254 (1937)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献