default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn W. Moon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Yaakov Malinovsky, John W. Moon:
On round-robin tournaments with a unique maximum score. Australas. J Comb. 89: 24-31 (2024)
2000 – 2009
- 2004
- [j36]Denis Hanson, John W. Moon:
Weakening arcs in tournaments. J. Graph Theory 45(2): 142-162 (2004) - 2002
- [j35]John W. Moon:
On the centroid of recursive trees. Australas. J Comb. 25: 211-220 (2002) - [j34]Amram Meir, John W. Moon:
On centroid branches of trees from certain families. Discret. Math. 250(1-3): 153-170 (2002) - 2001
- [j33]Louis W. Shapiro, Richard Ehrenborg, John W. Moon, Michael Reid:
Leaves of Ordered Trees: 10753. Am. Math. Mon. 108(9): 873-874 (2001) - 2000
- [j32]John W. Moon, Helmut Prodinger:
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees. Ars Comb. 55 (2000)
1990 – 1999
- 1999
- [j31]Lane H. Clark, Amram Meir, John W. Moon:
On the Steiner distance of trees from certain families. Australas. J Comb. 20: 47-68 (1999) - [j30]Amram Meir, John W. Moon:
On the Bipartition Numbers of Random Trees, II. Ars Comb. 51 (1999) - [j29]Lane H. Clark, John W. Moon:
On the General Randic Index for Certain Families of Trees. Ars Comb. 54 (1999) - 1998
- [j28]Amram Meir, John W. Moon:
On the log-product of the subtree-sizes of random trees. Random Struct. Algorithms 12(2): 197-212 (1998) - [j27]Amram Meir, John W. Moon:
Addendum to On the log-product of the subtree-sizes of random trees. Random Struct. Algorithms 12(4): 405 (1998) - 1997
- [j26]John W. Moon:
On the number of induced subgraphs of trees. Discret. Math. 167-168: 487-496 (1997) - 1996
- [j25]John W. Moon:
On the total distance between nodes in tournaments. Discret. Math. 151(1-3): 169-174 (1996) - 1995
- [j24]Amram Meir, John W. Moon:
On path entropy functions for rooted trees. Discret. Math. 138(1-3): 319-326 (1995) - [j23]Shinsei Tazawa, Chiê Nara, John W. Moon:
The number of 4-cycles in triangle-free oriented graphs. Discret. Math. 143(1-3): 287-291 (1995) - 1994
- [j22]Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely:
On the Wiener index of trees from certain families. Australas. J Comb. 10: 211-224 (1994) - [j21]John W. Moon:
Some determinant expansions and the matrix-tree theorem. Discret. Math. 124(1-3): 163-171 (1994) - 1993
- [j20]John W. Moon:
Uncovered nodes and 3-cycles in tournaments. Australas. J Comb. 7: 157-174 (1993) - 1990
- [j19]Amram Meir, John W. Moon:
On the maximum out-degree in random trees. Australas. J Comb. 2: 147-156 (1990) - [j18]Amram Meir, John W. Moon:
The Asymptotic Behaviour of Coefficients of Powers of Certain Generating Functions. Eur. J. Comb. 11(6): 581-587 (1990)
1980 – 1989
- 1989
- [j17]Amram Meir, John W. Moon:
On an asymptotic method in enumeration. J. Comb. Theory A 51(1): 77-89 (1989) - 1988
- [j16]Amram Meir, John W. Moon:
Survival under random coverings of trees. Graphs Comb. 4(1): 49-65 (1988) - [j15]Harry Lakser, N. S. Mendelsohn, John W. Moon:
Amalgamation of team tournaments. J. Comb. Theory B 45(1): 115-119 (1988) - [j14]Amram Meir, John W. Moon:
On maximal independent sets of nodes in trees. J. Graph Theory 12(2): 265-283 (1988) - 1987
- [j13]John W. Moon:
The number of trees with a 1-factor. Discret. Math. 63(1): 27-37 (1987) - 1984
- [j12]Amram Meir, John W. Moon:
On random mapping patterns. Comb. 4(1): 61-70 (1984) - 1983
- [j11]Amram Meir, John W. Moon:
On an asymptotic evaluation of the cycle index of the symmetric group. Discret. Math. 46(1): 103-105 (1983) - [j10]Amram Meir, John W. Moon, Jan Mycielski:
Hereditarily finite sets and identity trees. J. Comb. Theory B 35(2): 142-155 (1983) - 1982
- [j9]John W. Moon:
The number of tournaments with a unique spanning cycle. J. Graph Theory 6(3): 303-308 (1982) - 1980
- [j8]John W. Moon:
Lattice Paths in Regions with the Catalan Property. J. Comb. Theory A 28(1): 98-102 (1980) - [j7]Amram Meir, John W. Moon, J. R. Pounder:
On the Order of Random Channel Networks. SIAM J. Algebraic Discret. Methods 1(1): 25-33 (1980) - [j6]Amram Meir, John W. Moon, J. R. Pounder:
Acknowledgment of Priority: On the Order of Random Channel Networks. SIAM J. Algebraic Discret. Methods 1(4): 462 (1980)
1970 – 1979
- 1979
- [j5]John W. Moon:
Some enumeration problems for similarity relations. Discret. Math. 26(3): 251-260 (1979) - 1977
- [j4]John W. Moon, M. Sobel:
Enumerating a class of nested group testing procedures. J. Comb. Theory B 23(2-3): 184-188 (1977) - [j3]Amram Meir, John W. Moon:
Packing and covering constants for certain families of trees. I. J. Graph Theory 1(2): 157-174 (1977) - 1976
- [j2]John W. Moon:
A problem on arcs without bypasses in tournaments. J. Comb. Theory B 21(1): 71-75 (1976) - 1972
- [j1]John W. Moon:
Embedding tournaments in simple tournaments. Discret. Math. 2(4): 389-395 (1972)
1960 – 1969
- 1968
- [c1]Norman J. Pullman, John W. Moon:
Tournaments and handicaps. IFIP Congress (1) 1968: 219-223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
