Mortal and eternal vertex covers
Anderson, Mark; Brigham, Robert C.; Carrington, Julie R.; Dutton, Ronald D.; Vitray, Richard P.
J. Comb. Math. Comb. Comput. 99, 3-21 (2016).
Spread conditions for some Hamiltonian properties of a graph
Li, Rao
J. Comb. Math. Comb. Comput. 99, 23-27 (2016).
Uniform coverings of 2-paths in the complete graph and the complete bipartite graph
Kobayashi, Midori; Nakamura, Gisaku
J. Comb. Math. Comb. Comput. 99, 29-39 (2016).
Designs from maximal subgroups and conjugacy classes of finite simple groups
Key, J. D.; Moori, J.
J. Comb. Math. Comb. Comput. 99, 41-60 (2016).
On the Ramsey number for cycle with respect to identical copies of complete graphs
Sudarsana, I. Wayan
J. Comb. Math. Comb. Comput. 99, 61-68 (2016).
Cohesion and non-separating trees in connected graphs
Gottipati, Chenchu B.; Locke, Stephen C.
J. Comb. Math. Comb. Comput. 99, 69-79 (2016).
A construction of multi-sender authentication codes from polynomials over finite fields
Wang, Xiuli; Wang, Lina
J. Comb. Math. Comb. Comput. 99, 81-88 (2016).
Monochromatic connectivity in monochromatic-star-free graphs
Magnant, Colton; Salehi-Nowbandegani, Pouria
J. Comb. Math. Comb. Comput. 99, 89-96 (2016).
A note on the fair domination in trees
Rad, Nader Jafari; Sofia, Roghayyeh Qezel
J. Comb. Math. Comb. Comput. 99, 97-105 (2016).
Some bounds on the size of DI-pathological graphs
Asplund, John; Chaffee, Joe; Hammer, James M.
J. Comb. Math. Comb. Comput. 99, 107-129 (2016).
Flanking numbers and arankings of cyclic graphs
Short, Daniel; Kaplan, Nathan; Narayan, Darren A.
J. Comb. Math. Comb. Comput. 99, 131-150 (2016).
Degree monotone paths and graph operations
Caro, Yair; Lauri, Josef; Zarb, Christina
J. Comb. Math. Comb. Comput. 99, 151-166 (2016).
A collection of results on saturation numbers
Jambulapati, Arun; Faudree, Ralph
J. Comb. Math. Comb. Comput. 99, 167-185 (2016).
On the equivalence of the upper open irredundance and fractional upper open irredundance numbers of a graph
Fricke, Gerd H.; O’Brien, Tim; Schroeder, Chris; Hedetniemi, Stephen T.
J. Comb. Math. Comb. Comput. 99, 187-198 (2016).
Critical pebbling numbers of graphs
Gibbons, Courtney R.; Laison, Joshua D.; Paul, Erick J.
J. Comb. Math. Comb. Comput. 99, 199-224 (2016).
An optimization problem for combinatorial key predistribution
Ma, Xinrong; Stinson, Douglas R.; Wei, Ruizhong
J. Comb. Math. Comb. Comput. 99, 225-235 (2016).
An anti-Waring theorem
Looper, Nicole; Saritzky, Nathan
J. Comb. Math. Comb. Comput. 99, 237-240 (2016).
Construction of deterministic compressed sensing matrices based on error-correcting pooling designs
Liu, Xuemei; Jie, Yingmo; Zhang, Yinbo
J. Comb. Math. Comb. Comput. 99, 241-254 (2016).
On ordered directed ρ-labelings of bipartite digraphs and cyclic digraph decompositions
Bunge, Ryan C.; El-Zanati, Saad I.; Klister, Jessica; Roberts, Dan; Ruddell, Catherine
J. Comb. Math. Comb. Comput. 99, 255-268 (2016).
On radio labeling edge-balanced caterpillars
Benson, Katherine F.
J. Comb. Math. Comb. Comput. 99, 269-305 (2016).
