Proceedings of the Forty-third Southeastern International Conference on Combinatorics, Graph theory and Computing. Congr. Numer. 214, 1-207 (2012).
Graph avoidance in Hamilton laceable bipartite graphs
Simmons, Gustavus J.
Congr. Numer. 214, 5-31 (2012).
Graph avoidance in Hamilton laceable bipartite graphs: a sequel
Simmons, Gustavus J.
Congr. Numer. 214, 33-47 (2012).
Some properties of the sum ∑ni=0ip(n+ii)
Larcombe, Peter J.; Fennessey, Eric J.
Congr. Numer. 214, 49-64 (2012).
The integer-magic spectra of bicyclic graphs without pendant
Shiu, W. C.; Low, Richard M.
Congr. Numer. 214, 65-73 (2012).
Ultra-security in graphs
Petrie, Caleb
Congr. Numer. 214, 75-80 (2012).
Fuzzy process particle swarm optimization
Coffman-Wolph, Stephany; Kountanis, Dionysios
Congr. Numer. 214, 81-95 (2012).
Building a pseudorandom function using a Naor-Reingold type construction
Gao, WeiZheng
Congr. Numer. 214, 97-101 (2012).
From puzzles to graphs to colorings
Phinezy, Bryan; Zhang, Ping
Congr. Numer. 214, 103-119 (2012).
Fine ballot numbers
Sullivan, Shaun
Congr. Numer. 214, 121-129 (2012).
Graph products and integer domination. II
John, Niluk; Suen, Stephen
Congr. Numer. 214, 131-141 (2012).
On separating convex points with lines
Toda, Takahisa; Vigan, Ivo
Congr. Numer. 214, 143-153 (2012).
On the irreducible no-hole L(h,k) coloring of graphs
Held, Ryan; Jacob, Jobby
Congr. Numer. 214, 155-166 (2012).
On modular and graceful labelings
Jones, Ryan; Zhang, Ping
Congr. Numer. 214, 167-178 (2012).
Grundy numbers of strong products of graphs
Bode, Jens-P.; Hillert, Christoph; Kemnitz, Arnfried
Congr. Numer. 214, 179-186 (2012).
The minimum of the maximum rectilinear crossing numbers of small cubic graphs
Alpert, Matthew; Bode, Jens-P.; Feder, Elie; Harborth, Heiko
Congr. Numer. 214, 187-197 (2012).
Spoiled child trees
Shapiro, Louis W.; Davenport, Dennis E.; Woodson, Leon C.
Congr. Numer. 214, 199-206 (2012).