Champion spiders in the game of Graph Nim
Calkin, Neil J.; Janoski, Janine E.; Nelson, Allison; Ryan, Sydney; Xu, Chao
Congr. Numer. 218, 5-19 (2013).
On total distances of cyclic orderings and Hamiltonian spectrums
Fujie, Futaba; Zhang, Ping
Congr. Numer. 218, 21-32 (2013).
Packages and purges for peg solitaire on graphs
Beeler, Robert A.; Walvoort, Clayton A.
Congr. Numer. 218, 33-42 (2013).
Reductions on double occurrence words
Arredondo, Ryan
Congr. Numer. 218, 43-56 (2013).
New lower bounds for matching numbers of general and bipartite graphs
Jahanbekam, Sogol; West, Douglas B.
Congr. Numer. 218, 57-59 (2013).
Applications of the matrix of forbidden pairs
Mihnea, Amy; Hoffman, Frederick
Congr. Numer. 218, 61-72 (2013).
On cyclic decompositions of Kn+1,n+1−I into a 2-regular graph with at most 2 components
Bunge, R. C.; El-Zanati, S. I.; Gibson, D.; Jongthawonwuth, U.; Nagel, J.; Stanley, B.; Zale, A.
Congr. Numer. 218, 73-84 (2013).
Hamiltonicity in Cn×Cm after a 2-skip row
Carr, Edward C.
Congr. Numer. 218, 85-92 (2013).
Multi-level weighted all-different constraint
Kruk, Serge; Nguyen, Michael
Congr. Numer. 218, 93-100 (2013).
The distinguishing chromatic number of line graphs of complete graphs
Kanaana, Izabela; Neal, Cora
Congr. Numer. 218, 101-109 (2013).
t-covering arrays generated by a tiling probability model
Donders, Michael S.; Godbole, Anant P.
Congr. Numer. 218, 111-116 (2013).
k-primitivity of binary matrices and digraphs
Beasley, LeRoy B.; Mousley, Sarah
Congr. Numer. 218, 117-133 (2013).
Clique cover width and clique sum
Shahrokhi, Farhad
Congr. Numer. 218, 135-140 (2013).
Grundy critical graphs
Bode, Jens-P.; Kemnitz, Arnfried
Congr. Numer. 218, 141-147 (2013).
Improving isomorphism rejection in sets of graphs
Bate, John
Congr. Numer. 218, 149-155 (2013).
On modular monochromatic (2,0)-colorings
Andrews, Eric; Lumduanhom, Chira; Zhang, Fing
Congr. Numer. 218, 157-175 (2013).