One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, know...
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders...
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Vol...