Hendrika Cornelia Swart
Goddard, Wayne; Henning, Michael A.; Oellermann, Ortrud R.
Util. Math. 69, 3-11 (2006).
Detectable colorings of graphs
Chartrand, Gary; Escuardro, Henry; Okamoto, Futaba; Zhang, Ping
Util. Math. 69, 13-32 (2006).
The metric dimension of Cartesian products of graphs
Peters-Fransen, Joel; Oellermann, Ortrud R.
Util. Math. 69, 33-41 (2006).
Differentials in graphs
Mashburn, J. L.; Haynes, T. W.; Hedetniemi, S. M.; Hedetniemi, S. T.; Slater, P. J.
Util. Math. 69, 43-54 (2006).
The L(d,1)-hole index of paths and cycles
Jonck, Elizabeth; Hattingh, Johannes H.; Ras, Charl J.
Util. Math. 69, 55-64 (2006).
Irreducibility of L(2,1)-colorings and the inh-colorability of unicyclic and hex graphs
Laskar, Renu C.; Villalpando, John J.
Util. Math. 69, 65-83 (2006).
On the connectivity and matchings in 3-vertex-critical claw-free graphs
Ananchuen, Nawarat; Plummer, Michael D.
Util. Math. 69, 85-96 (2006).
Modality distance between graphs
Kraetzl, M.; Wallis, W. D.
Util. Math. 69, 97-102 (2006).
A minimal critical set of a class of Youden squares
Fitina, Lakoa; Russell, Kenneth G.; Seberry, Jennifer
Util. Math. 69, 103-108 (2006).
Cycle lengths in planar graphs
Verstraëte, Jacques
Util. Math. 69, 109-117 (2006).
Packings in dodecads
Stanton, R. G.
Util. Math. 69, 119-127 (2006).
The queens separation problem
Chatham, R. Douglas; Fricke, Gerd H.; Skaggs, R. Duane
Util. Math. 69, 129-141 (2006).
The depression of a graph
Cockayne, E. J.; Geldenhuys, G.; Grobler, P. J. P.; Mynhardt, C. M.; van Vuuren, J. H.
Util. Math. 69, 143-160 (2006).
Explicit solutions to Newton’s recurrence and their interpretations
Schwenk, Allen J.
Util. Math. 69, 161-169 (2006).
The influence of the addition or deletion of a vertex or an edge on the induced path number of a graph
Broere, Izak; Jonck, Elizabeth; Domke, Gayla S.
Util. Math. 69, 171-182 (2006).
The Krausz dimension of a graph
Beineke, Lowell W.; Broere, Izak
Util. Math. 69, 183-194 (2006).
A new approach to the path partition conjecture
Frick, Marietjie; Whitehead, Carol
Util. Math. 69, 195-206 (2006).
Trees with equal total domination and paired-domination numbers
Henning, Michael A.
Util. Math. 69, 207-218 (2006).
Oscillation of graphs
Burger, A. P.; Cockayne, E. J.
Util. Math. 69, 219-226 (2006).
A note on the integrity of trees
Goddard, Wayne
Util. Math. 69, 227-232 (2006).
Average distance, minimum degree, and size
Dankelmann, Peter
Util. Math. 69, 233-243 (2006).
Some combinatorial invariants related to a cryptosystem
Brincat, Karl; Piper, Fred; Wild, Peter
Util. Math. 69, 245-252 (2006).
