On color frames of claws in graphs
Chartrand, Gary; Johnston, Daniel; Zhang, Ping
J. Comb. Math. Comb. Comput. 85, 13-31 (2013).
Eternal domination numbers of 4×n grid graphs
Beaton, I.; Finbow, S.; MacDonald, J. A.
J. Comb. Math. Comb. Comput. 85, 33-48 (2013).
Homomorphically full reflexive graphs and digraphs
Huang, Jing; MacGillivray, Gary
J. Comb. Math. Comb. Comput. 85, 49-64 (2013).
Gathering information in a graph
Beaudou, Laurent; Grappe, Roland; Hahn, Geña
J. Comb. Math. Comb. Comput. 85, 65-78 (2013).
An eternal vertex cover problem
Klostermeyer, William F.
J. Comb. Math. Comb. Comput. 85, 79-95 (2013).
ID codes in Cartesian products of cliques
Goddard, Wayne; Wash, Kirsti
J. Comb. Math. Comb. Comput. 85, 97-106 (2013).
Hamiltonian properties of independent domination critical graphs
Ao, S.; MacGillivray, G.; Simmons, J.
J. Comb. Math. Comb. Comput. 85, 107-128 (2013).
Perfection in graphs, a new look at irredundance
Hedetniemi, Jason T.; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.
J. Comb. Math. Comb. Comput. 85, 129-139 (2013).
Cops-and-robbers: remarks and problems
Boyer, Michel; El Harti, Sif; El Ouarari, Amal; Ganian, Robert; Gavenčiak, Tomáš; Hahn, Geña; Moldenauer, Carsten; Rutter, Ignaz; Thériault, Benoit; Vatshelle, Martin
J. Comb. Math. Comb. Comput. 85, 141-159 (2013).
The cost of 2-distinguishing selected Kneser graphs and hypercubes
Boutin, Debra L.
J. Comb. Math. Comb. Comput. 85, 161-171 (2013).
Fast enumeration of all independent sets of a graph up to isomorphism
Myrvold, Wendy; Fowler, Patrick W.
J. Comb. Math. Comb. Comput. 85, 173-194 (2013).
Edge colourings and the depression of a graph
Schurch, M.
J. Comb. Math. Comb. Comput. 85, 195-212 (2013).
The game of timber!
Nowakowski, Richard J.; Renault, Gabriel; Lamoureux, Emily; Mellon, Stephanie; Miller, Timothy
J. Comb. Math. Comb. Comput. 85, 213-225 (2013).
Characterizing homogenous digraphs
Huang, Jing
J. Comb. Math. Comb. Comput. 85, 227-236 (2013).
Global domination stable trees
Still, Elisabeth Marie; Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 85, 237-252 (2013).
On the null space structure associated with trees and cycles
Fallat, Shaun M.; Nasserasr, Shahla
J. Comb. Math. Comb. Comput. 85, 253-272 (2013).
On domination and digital convexity parameters
Oellermann, Ortrud R.
J. Comb. Math. Comb. Comput. 85, 273-285 (2013).
On well-covered quadrangulations
Finbow, Arthur S.; Hartnell, Bert L.; Plummer, Michael D.
J. Comb. Math. Comb. Comput. 85, 287-297 (2013).
Distinguishing chromatic numbers of wreath products
Hodgins, C. J.; Seyffarth, K.
J. Comb. Math. Comb. Comput. 85, 299-319 (2013).
Two algorithms for secure graph domination
Burger, A. P.; de Villiers, A. P.; van Vuuren, J. H.
J. Comb. Math. Comb. Comput. 85, 321-339 (2013).
A new proof of a characterization of (k,l)-colourable chordal graphs
Epple, Dennis D. A.
J. Comb. Math. Comb. Comput. 85, 341-344 (2013).
A new lower bound for the irredundance number of a tree
Fricke, Gerd; O’Brien, Timothy J.; Schroeder, W. Christopher; Hedetniemi, Stephen T.
J. Comb. Math. Comb. Comput. 85, 345-352 (2013).
Induced-hereditary graph properties, homogeneity, extensibility and universality
Broere, Izak; Heidema, Johannes
J. Comb. Math. Comb. Comput. 85, 353-363 (2013).
Nordhaus-Gaddum type results for the induced path number with relative complements in Km,n
Hattingh, Johannes H.; Saleh, Ossama A.; Van der Merwe, Lucas; Walters, Terry J.
J. Comb. Math. Comb. Comput. 85, 365-377 (2013).
