Proceedings of the Forty-third Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 211, 1-212 (2012).
Neighbor-distinguishing metric sets – results and open questions
Fujie, Futaba; Phinezy, Bryan; Zhang, Ping
Congr. Numer. 211, 5-22 (2012).
Infinite graphs with finite lp-rank number: a characterization
Jacob, Bonnie C.; Jacob, Jobby
Congr. Numer. 211, 23-31 (2012).
Minimum fractional totally dominating functions and maximum fractional open neighborhood packings in connected finite graphs
Prier, David R.
Congr. Numer. 211, 33-55 (2012).
Guarding orthogonal prison yards: an upper bound
Michael, T. S.; Pinciu, Val
Congr. Numer. 211, 57-64 (2012).
Rado numbers for the equation x1+3×2+c=x3
Schaal, Daniel; Zinter, Melanie
Congr. Numer. 211, 65-71 (2012).
Proving properties of the edge elimination polynomial using equivalent graph polynomials
Trinks, Martin
Congr. Numer. 211, 73-88 (2012).
A coding problem via quantum channels
Tran, Hoa
Congr. Numer. 211, 89-96 (2012).
Some large sets of cyclic triple systems
Tian, Zi Hon; Wei, Ruizhong
Congr. Numer. 211, 97-131 (2012).
Decomposition of complete graphs into small bipartite prisms
Cichacz, Sylwia; Froncek, Dalibor; Meszka, Mariusz
Congr. Numer. 211, 133-140 (2012).
Preliminary results on distance-preserving graphs
Nussbaum, Ronald; Esfahanian, Abdol-Hossein
Congr. Numer. 211, 141-149 (2012).
Peg solitaire on graphs with seven vertices or less
Beeler, Robert A.; Gray, Aaron D.
Congr. Numer. 211, 151-159 (2012).
Isolation number versus Boolean rank in tournaments
Brown, David E.; Roy, Scott
Congr. Numer. 211, 161-169 (2012).
Nordhaus-Gaddum class theorems for k-decompositions
Bickle, Allan
Congr. Numer. 211, 171-183 (2012).
Edge centered surface areas of bipartite graphs
Cheng, Eddy; Qiu, Ke; Shen, Zhi Zhang
Congr. Numer. 211, 185-196 (2012).
Cost effective domination in graphs
Haynes, Teresa W.; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; McCoy, Tabitha L.; Vasylieva, Inna
Congr. Numer. 211, 197-209 (2012).