|
|||||
 |
|
|
|
|
|
Vol. 10, No. 5, 2017 |
|
Algorithms for finding
knight's tours on Aztec diamonds
721–734
Samantha Davies, Chenxiao Xue and Carl R. Yerger |
|
Optimal aggression in
kleptoparasitic interactions
735–747
David G. Sykes and Jan Rychtář |
|
Domination with decay in
triangular matchstick arrangement graphs
749–766
Jill Cochran, Terry Henderson, Aaron Ostrander and Ron Taylor |
|
On the tree cover number of
a graph
767–779
Chassidy Bozeman, Minerva Catral, Brendan Cook, Oscar E. González and Carolyn Reinhart |
|
Matrix completions for
linear matrix equations
781–799
Geoffrey Buhl, Elijah Cronk, Rosa Moreno, Kirsten Morris, Dianne Pedroza and Jack Ryan |
|
The Hamiltonian problem and
$t$-path traceable graphs
801–812
Kashif Bari and Michael E. O’Sullivan |
|
Relations between the
conditions of admitting cycles in Boolean and ODE network
systems
813–831
Yunjiao Wang, Bamidele Omidiran, Franklin Kigwe and Kiran Chilakamarri |
|
Weak and strong solutions
to the inverse-square brachistochrone problem on circular and
annular domains
833–856
Christopher Grimm and John A. Gemmer |
|
Numerical existence and
stability of solutions to the distributed spruce budworm
model
857–879
Hala Al-Khalil, Catherine Brennan, Robert Decker, Aslihan Demirkaya and Jamie Nagode |
|
Integer solutions to $x^2 +
y^2 = z^2 - k$ for a fixed integer value $k$
881–892
Wanda Boyer, Gary MacGillivray, Laura Morrison, C. M. (Kieka) Mynhardt and Shahla Nasserasr |
|
A solution to a problem of
Frechette and Locus
893–900
Chenthuran Abeyakaran |
|
