Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Locke, Stephen C."'
For a graph $G = (V, E)$ embedded in the Klein bottle, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a $C_k$-face-magic Klein bottle graph if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any
Externí odkaz:
http://arxiv.org/abs/2206.02028
Publikováno v:
The American Mathematical Monthly, 2018 Jun 01. 125(6), 569-570.
Externí odkaz:
https://www.jstor.org/stable/48662626
Publikováno v:
In Discrete Applied Mathematics 31 July 2018 244:44-55
Autor:
Locke, Stephen C., Morris, Dave Witte
We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to
Externí odkaz:
http://arxiv.org/abs/math/9702227
We introduce a version of Nim played on a Boolean matrix. Each player, in turn, removes a nonzero row or column. The last player to remove a row or column wins. We investigate the Boolean matrices that represent the Ferrers diagram of an integer part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::875ab57aae0d3c3dc780b6b8752d703e
Autor:
Locke, Stephen C., Stong, Richard
Publikováno v:
The American Mathematical Monthly, 2006 Apr 01. 113(4), 372-372.
Externí odkaz:
https://www.jstor.org/stable/27641938
Publikováno v:
Integers: Electronic Journal of Combinatorial Number Theory; 2022, Vol. 22, p1-15, 15p
Publikováno v:
Integers: Electronic Journal of Combinatorial Number Theory; 2021, Vol. 21, p1-26, 26p
Autor:
Barovich, Mark V. *, Locke, Stephen C.
Publikováno v:
In Discrete Mathematics 2000 220(1):13-33
Autor:
Locke, Stephen C., Witte, Dave
Publikováno v:
Journal of Graph Theory; 1999, Vol. 30 Issue 4, p319-331, 13p