Generalization of polya’s fundamental theorem in enumerative combinatorial analysis
-
Published:1959
Issue:
Volume:62
Page:59-69
-
ISSN:1385-7258
-
Container-title:Indagationes Mathematicae (Proceedings)
-
language:en
-
Short-container-title:Indagationes Mathematicae (Proceedings)
Reference2 articles.
1. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und Chemische Verbindungen;Polya;Acta Math.,1937
2. An introduction to Combinatorial Analysis, New York–London;Riordan,1958
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Set-Valuations of Graphs and Their Applications;Handbook of Research on Advanced Applications of Graph Theory in Modern Society;2020
2. A Group Algebraic Approach to NPN Classification of Boolean Functions;Theory of Computing Systems;2018-11-29
3. Combinatorics;Wiley StatsRef: Statistics Reference Online;2014-09-29
4. The combinatorics of N.G. de Bruijn;Indagationes Mathematicae;2013-11
5. On the use of symmetry in configurational analysis for the simulation of disordered solids;Journal of Physics: Condensed Matter;2013-02-06