Skip to main content

Search results

(1 - 10 of 10)




Bookmarks:

Title: Sprague-Grundy values of Modular Nim
Source: Integers
Date: 2019
Author: Horrocks, David G. C.; Horrocks, Jonathan H.
Genre: Journal Article
Volume: 19
Start Page: G1




Bookmarks:

Title: Winning positions in simplicial Nim ( Research Paper 84)
Source: Electronic Journal of Combinatorics
Date: 2010
Author: Horrocks, David
Genre: Journal Article
Volume: 17
Issue: 1




Bookmarks:

Title: Subtraction with a Muller twist
Source: Integers
Date: 2008
Author: Horrocks, D.G.; Trenton, M. A.
Genre: Journal Article
Volume: 8
Start Page: G05




Bookmarks:

Title: Geography played on an N-cycle times a 4-cycle
Source: Integers
Date: 2003
Author: Hogan, M. S.; Horrocks, D.G.
Genre: Journal Article
Volume: 3
Start Page: G2




Bookmarks:

Title: Regularity in the G-sequences of octal games with a pass
Source: Integers
Date: 2003
Author: Horrocks, D. G.; Nowakowski, R. J.
Genre: Journal Article
Volume: 3
Start Page: G1




Bookmarks:

Title: The numbers of dependent k-sets in a graph are log concave
Source: Journal of Combinatorial Theory Series B
Date: 2002
Author: Horrocks, D. G. C.
Genre: Journal Article
Abstract: A set of vertices in a graph is said to be dependent if it is not independent. Let p(k)(G) denote the number of dependent sets of size k in the...
Volume: 84
Issue: 1
Start Page: 180
DOI: 10.1006/jctb.2001.2077




Bookmarks:

Title: Doubly dependent sets in graphs
Source: Australasian Journal of Combinatorics
Date: 2000
Author: Horrocks, David G. C.
Genre: Journal Article
Volume: 22
Start Page: 105




Bookmarks:

Title: On Lih's conjecture concerning spernerity
Source: European Journal of Combinatorics
Date: 1999
Author: Horrocks, D. G. C.
Genre: Journal Article
Abstract: Let F be a nonempty collection of subsets of [n] = {1, 2,..., n}, each having cardinality t. Denote by P-F the poser consisting of all subsets of ...
Volume: 20
Issue: 2
Start Page: 131




Bookmarks:

Title: On the number of dependent sets in a connected graph
Source: Ars Combinatoria
Date: 1999
Author: Horrocks, D. G. C.
Genre: Journal Article
Abstract: A set X of vertices of a graph is said to be dependent if X is not an independent set. For the graph G, let P-k(G) denote the set of dependent sets...
Volume: 53
Start Page: 239




Bookmarks:

Title: Nested chain partitions of Hamiltonian filters
Source: Journal of Combinatorial Theory Series A
Date: 1998
Author: Horrocks, D. G. C.
Genre: Journal Article
Abstract: Let P be a poset, consisting of all sets X subset of or equal to [n] = {1, 2, ..., n} which contain at least one of a given collection F of 2...
Volume: 81
Issue: 2
Start Page: 176
DOI: 10.1006/jcta.1997.2824