Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen

G. Pólya1

(1)  Zürich


Ohne Zusammenfassung

Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.

Export this article
Export this article as RIS | Text
 
Referenced by
157 newer articles

  1. Schneeweiss, Winfrid G. (1980) . IEEE Transactions on Reliability r-29(4)
    [CrossRef]
  2. Plesken, W. (2009) The average number of cycles. Archiv der Mathematik
    [CrossRef]
  3. Tak cs, Lajos, 2006
    [CrossRef]
  4. King, R. Bruce, 2002
    [CrossRef]
  5. Weininger, David, 2002
    [CrossRef]
  6. Riddell, R. J. (1953) On the Theory of the Virial Development of the Equation of State of Monoatomic Gases. The Journal of Chemical Physics 21(11)
    [CrossRef]
  7. Hübener, Robert (2009) Geometric measure of entanglement for symmetric states. Physical Review A 80(3)
    [CrossRef]
  8. Wright, E. M. (1974) Asymmetric and symmetric graphs. Glasgow Mathematical Journal 15(1)
    [CrossRef]
  9. Flanigan, J. A. (1981) On the distribution of winning moves in random game trees. Bulletin of the Australian Mathematical Society 24(2)
    [CrossRef]
  10. Plotkin, J. M. (1994) How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function. Journal of the Australian Mathematical Society 56(1)
    [CrossRef]
First | Next | Last
Remote Address: 195.221.21.171 • Server: mpweb15
HTTP User Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.9) Gecko/2008061015 Firefox/3.0