On iterated clique graphs with increasing diameters. - Claudine Peyrat; Douglas F. Rall; Peter J. Slater (J. Graph Theory, 1986)

Convex labelings of trees. - Stephen J. Dow; Douglas F. Rall; Peter J. Slater (J. Graph Theory, 1987)

Domatically critical and domatically full graphs. - Douglas F. Rall (Discret. Math., 1990)

Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. - Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Discret. Appl. Math., 1993)

Bounds on the bondage number of a graph. - Bert L. Hartnell; Douglas F. Rall (Discret. Math., 1994)

Vizing's conjecture and the one-half argument. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 1995)

Associative graph products and their independence, domination and coloring numbers. - Richard J. Nowakowski; Douglas F. Rall (Discuss. Math. Graph Theory, 1996)

Star-factors and k-bounded total domination. - Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Networks, 1996)

The Ultimate Categorical Independence Ratio of a Graph. - Jason I. Brown; Richard J. Nowakowski; Douglas F. Rall (SIAM J. Discret. Math., 1996)

On Seed Graphs with Two Components. - Lisa R. Markus; Douglas F. Rall (Ars Comb., 1998)

A bound on the size of a graph with given order and bondage number. - Bert L. Hartnell; Douglas F. Rall (Discret. Math., 1999)

Acyclic domination. - Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Douglas F. Rall (Discret. Math., 2000)

On the independence number of the Cartesian product of caterpillars. - Scott P. Martin; Jeffrey S. Powell; Douglas F. Rall (Ars Comb., 2001)

On k-dependent domination. - Odile Favaron; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Douglas F. Rall (Discret. Math., 2002)

Improving some bounds for dominating Cartesian products. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 2003)

On dominating the Cartesian product of a graph and K2. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 2004)

Bicritical domination. - Robert C. Brigham; Teresa W. Haynes; Michael A. Henning; Douglas F. Rall (Discret. Math., 2005)

Total Domination in Categorical Products of Graphs. - Douglas F. Rall (Discuss. Math. Graph Theory, 2005)

Paired-domination of Cartesian products of graphs and rainbow domination. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Electron. Notes Discret. Math., 2005)

On the Total Domination Number of Cartesian Products of Graphs. - Michael A. Henning; Douglas F. Rall (Graphs Comb., 2005)

On graphs having uniform size star factors. - Bert L. Hartnell; Douglas F. Rall (Australas. J Comb., 2006)

Finite and infinite hypercubes as direct products. - Wilfried Imrich; Douglas F. Rall (Australas. J Comb., 2006)

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

Cancellation properties of products of graphs. - Wilfried Imrich; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

Dominating direct products of graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2007)

Braodcast Chromatic Numbers of Graphs. - Wayne Goddard; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; John M. Harris; Douglas F. Rall (Ars Comb., 2008)

On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. - Douglas F. Rall; Bostjan Bresar; Art S. Finbow; Sandi Klavzar (Electron. Notes Discret. Math., 2008)

On the upper total domination number of Cartesian products of graphs. - Paul Dorbec; Michael A. Henning; Douglas F. Rall (J. Comb. Optim., 2008)

Fair reception and Vizing's conjecture. - Bostjan Bresar; Douglas F. Rall (J. Graph Theory, 2009)

On the packing chromatic number of some lattices. - Arthur S. Finbow; Douglas F. Rall (Discret. Appl. Math., 2010)

Limited packings in graphs. - Robert P. Gallant; Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Discret. Appl. Math., 2010)

Domination Game and an Imagination Strategy. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (SIAM J. Discret. Math., 2010)

Vizing's conjecture: a survey and recent results. - Bostjan Bresar; Paul Dorbec; Wayne Goddard; Bert L. Hartnell; Michael A. Henning; Sandi Klavzar; Douglas F. Rall (J. Graph Theory, 2012)

On the Cartesian Product of Non Well-Covered Graphs. - Bert L. Hartnell; Douglas F. Rall (Electron. J. Comb., 2013)

Domination game: Extremal families of graphs for 3/53/5-conjectures. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Appl. Math., 2013)

Rainbow domination in the lexicographic product of graphs. - Tadeja Kraner Sumenjak; Douglas F. Rall; Aleksandra Tepeh (Discret. Appl. Math., 2013)

Domination game played on trees and spanning subgraphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2013)

On graphs with disjoint dominating and 2-dominating sets. - Michael A. Henning; Douglas F. Rall (Discuss. Math. Graph Theory, 2013)

On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. - Bert L. Hartnell; Douglas F. Rall (Graphs Comb., 2013)

Dominating sequences in graphs. - Bostjan Bresar; Tanja Gologranc; Martin Milanic; Douglas F. Rall; Romeo Rizzi (Discret. Math., 2014)

Relating the annihilation number and the 2-domination number of a tree. - Wyatt J. Desormeaux; Michael A. Henning; Douglas F. Rall; Anders Yeo (Discret. Math., 2014)

Identifying codes of the direct product of two cliques. - Douglas F. Rall; Kirsti Wash (Eur. J. Comb., 2014)

Guarded subgraphs and the domination game. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Math. Theor. Comput. Sci., 2015)

On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway. - Bostjan Bresar; Douglas F. Rall (Graphs Comb., 2015)

Total Version of the Domination Game. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2015)

Total dominating sequences in graphs. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Discret. Math., 2016)

Progress towards the total domination game -conjecture. - Michael A. Henning; Douglas F. Rall (Discret. Math., 2016)

Partitioning the vertex set of G to make G ☐ H an efficient open domination graph. - Tadeja Kraner Sumenjak; Iztok Peterin; Douglas F. Rall; Aleksandra Tepeh (Discret. Math. Theor. Comput. Sci., 2016)

Packing Chromatic Number of Base-3 Sierpiński Graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2016)

Uniformly dissociated graphs. - Bostjan Bresar; Bert L. Hartnell; Douglas F. Rall (Ars Math. Contemp., 2017)

The 4/5 upper bound on the game total domination number. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Comb., 2017)

Trees with equal total domination and game total domination numbers. - Michael A. Henning; Douglas F. Rall (Discret. Appl. Math., 2017)

Packing chromatic number under local changes in a graph. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall; Kirsti Wash (Discret. Math., 2017)

On Minimum Identifying Codes in Some Cartesian Product Graphs. - Douglas F. Rall; Kirsti Wash (Graphs Comb., 2017)

On k-rainbow independent domination in graphs. - Tadeja Kraner Sumenjak; Douglas F. Rall; Aleksandra Tepeh (Appl. Math. Comput., 2018)

Game total domination critical graphs. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2018)

On Well-Covered Cartesian Products. - Bert L. Hartnell; Douglas F. Rall; Kirsti Wash (Graphs Comb., 2018)

Domination game and minimal edge cuts. - Sandi Klavzar; Douglas F. Rall (Discret. Math., 2019)

Packing chromatic vertex-critical graphs. - Sandi Klavzar; Douglas F. Rall (Discret. Math. Theor. Comput. Sci., 2019)

A survey on packing colorings. - Bostjan Bresar; Jasmina Ferme; Sandi Klavzar; Douglas F. Rall (Discuss. Math. Graph Theory, 2020)

The enclaveless competition game. - Michael A. Henning; Douglas F. Rall (Ars Math. Contemp., 2021)

General d-position sets. - Sandi Klavzar; Douglas F. Rall; Ismael G. Yero (Ars Math. Contemp., 2021)

A new framework to approach Vizing's conjecture. - Bostjan Bresar; Bert L. Hartnell; Michael A. Henning; Kirsti Kuenzel; Douglas F. Rall (Discuss. Math. Graph Theory, 2021)

On Well-Dominated Graphs. - Sarah E. Anderson; Kirsti Kuenzel; Douglas F. Rall (Graphs Comb., 2021)

On well-covered direct products. - Kirsti Kuenzel; Douglas F. Rall (Discuss. Math. Graph Theory, 2022)

On Well-Edge-Dominated Graphs. - Sarah E. Anderson; Kirsti Kuenzel; Douglas F. Rall (Graphs Comb., 2022)

Correction to: On Well-Edge-Dominated Graphs. - Sarah E. Anderson; Kirsti Kuenzel; Douglas F. Rall (Graphs Comb., 2022)

Domination in digraphs and their direct and Cartesian products. - Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (J. Graph Theory, 2022)

Orientable domination in product-like graphs. - Sarah E. Anderson; Bostjan Bresar; Sandi Klavzar; Kirsti Kuenzel; Douglas F. Rall (Discret. Appl. Math., 2023)

On well-dominated direct, Cartesian and strong product graphs. - Douglas F. Rall (Discret. Math., 2023)

On Independent Domination in Direct Products. - Kirsti Kuenzel; Douglas F. Rall (Graphs Comb., 2023)

Graphs with equal Grundy domination and independence number. - Gábor Bacsó; Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (Discret. Optim., 2023)

Indicated domination game. - Bostjan Bresar; Csilla Bujtás; Vesna Irsic; Douglas F. Rall; Zsolt Tuza (Discret. Math., 2024)

A characterization of well-dominated Cartesian products. - Kirsti Kuenzel; Douglas F. Rall (Discret. Math., 2024)

Packings in bipartite prisms and hypercubes. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2024)

Indicated total domination game. - Michael A. Henning; Douglas F. Rall (Ars Math. Contemp., 2025)

Claw-free cubic graphs are (1,1,2,2)-colorable. - Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (Discret. Math., 2025)