default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas F. Rall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j77]Bostjan Bresar
, Sandi Klavzar, Douglas F. Rall:
Packings in bipartite prisms and hypercubes. Discret. Math. 347(4): 113875 (2024)- [j76]Kirsti Kuenzel, Douglas F. Rall:
A characterization of well-dominated Cartesian products. Discret. Math. 347(5): 113904 (2024) - [j75]Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024) - 2023
- [j74]Sarah E. Anderson, Bostjan Bresar, Sandi Klavzar, Kirsti Kuenzel, Douglas F. Rall:
Orientable domination in product-like graphs. Discret. Appl. Math. 326: 62-69 (2023) - [j73]Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Graphs with equal Grundy domination and independence number. Discret. Optim. 48(Part 2): 100777 (2023) - [j72]Douglas F. Rall:
On well-dominated direct, Cartesian and strong product graphs. Discret. Math. 346(1): 113178 (2023) - [j71]Kirsti Kuenzel, Douglas F. Rall:
On Independent Domination in Direct Products. Graphs Comb. 39(1): 7 (2023) - 2022
- [j70]Kirsti Kuenzel, Douglas F. Rall:
On well-covered direct products. Discuss. Math. Graph Theory 42(2): 627-640 (2022) - [j69]Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall:
On Well-Edge-Dominated Graphs. Graphs Comb. 38(4): 106 (2022) - [j68]Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall:
Correction to: On Well-Edge-Dominated Graphs. Graphs Comb. 38(5): 165 (2022) - [j67]Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Domination in digraphs and their direct and Cartesian products. J. Graph Theory 99(3): 359-377 (2022) - 2021
- [j66]Michael A. Henning, Douglas F. Rall:
The enclaveless competition game. Ars Math. Contemp. 20(1): 129-142 (2021) - [j65]Sandi Klavzar, Douglas F. Rall, Ismael G. Yero:
General d-position sets. Ars Math. Contemp. 21(1) (2021) - [j64]Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall:
A new framework to approach Vizing's conjecture. Discuss. Math. Graph Theory 41(3): 749-762 (2021) - [j63]Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall:
On Well-Dominated Graphs. Graphs Comb. 37(1): 151-165 (2021) - 2020
- [j62]Bostjan Bresar, Jasmina Ferme, Sandi Klavzar, Douglas F. Rall:
A survey on packing colorings. Discuss. Math. Graph Theory 40(4): 923-970 (2020)
2010 – 2019
- 2019
- [j61]Sandi Klavzar, Douglas F. Rall:
Domination game and minimal edge cuts. Discret. Math. 342(4): 951-958 (2019) - [j60]Sandi Klavzar, Douglas F. Rall:
Packing chromatic vertex-critical graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j59]Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh:
On k-rainbow independent domination in graphs. Appl. Math. Comput. 333: 353-361 (2018) - [j58]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Game total domination critical graphs. Discret. Appl. Math. 250: 28-37 (2018) - [j57]Bert L. Hartnell, Douglas F. Rall, Kirsti Wash:
On Well-Covered Cartesian Products. Graphs Comb. 34(6): 1259-1268 (2018) - 2017
- [j56]Bostjan Bresar, Bert L. Hartnell, Douglas F. Rall:
Uniformly dissociated graphs. Ars Math. Contemp. 13(2): 293-306 (2017) - [j55]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
The 4/5 upper bound on the game total domination number. Comb. 37(2): 223-251 (2017) - [j54]Michael A. Henning, Douglas F. Rall:
Trees with equal total domination and game total domination numbers. Discret. Appl. Math. 226: 58-70 (2017) - [j53]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall, Kirsti Wash:
Packing chromatic number under local changes in a graph. Discret. Math. 340(5): 1110-1115 (2017) - [j52]Douglas F. Rall, Kirsti Wash:
On Minimum Identifying Codes in Some Cartesian Product Graphs. Graphs Comb. 33(4): 1037-1053 (2017) - 2016
- [j51]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Total dominating sequences in graphs. Discret. Math. 339(6): 1665-1676 (2016) - [j50]Michael A. Henning, Douglas F. Rall:
Progress towards the total domination game -conjecture. Discret. Math. 339(11): 2620-2627 (2016) - [j49]Tadeja Kraner Sumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh:
Partitioning the vertex set of G to make G ☐ H an efficient open domination graph. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j48]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Packing Chromatic Number of Base-3 Sierpiński Graphs. Graphs Comb. 32(4): 1313-1327 (2016) - 2015
- [j47]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Guarded subgraphs and the domination game. Discret. Math. Theor. Comput. Sci. 17(1): 161-168 (2015) - [j46]Bostjan Bresar, Douglas F. Rall:
On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway. Graphs Comb. 31(5): 1263-1270 (2015) - [j45]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Total Version of the Domination Game. Graphs Comb. 31(5): 1453-1462 (2015) - 2014
- [j44]Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo:
Relating the annihilation number and the 2-domination number of a tree. Discret. Math. 319: 15-23 (2014) - [j43]Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi:
Dominating sequences in graphs. Discret. Math. 336: 22-36 (2014) - [j42]Douglas F. Rall, Kirsti Wash:
Identifying codes of the direct product of two cliques. Eur. J. Comb. 36: 159-171 (2014) - 2013
- [j41]Bert L. Hartnell, Douglas F. Rall:
On the Cartesian Product of Non Well-Covered Graphs. Electron. J. Comb. 20(2): 21 (2013) - [j40]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Domination game: Extremal families of graphs for 3/53/5-conjectures. Discret. Appl. Math. 161(10-11): 1308-1316 (2013) - [j39]Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh:
Rainbow domination in the lexicographic product of graphs. Discret. Appl. Math. 161(13-14): 2133-2141 (2013) - [j38]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination game played on trees and spanning subgraphs. Discret. Math. 313(8): 915-923 (2013) - [j37]Michael A. Henning, Douglas F. Rall:
On graphs with disjoint dominating and 2-dominating sets. Discuss. Math. Graph Theory 33(1): 139-146 (2013) - [j36]Bert L. Hartnell, Douglas F. Rall:
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. Graphs Comb. 29(3): 519-525 (2013) - 2012
- [j35]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - [i1]Bert L. Hartnell, Douglas F. Rall:
On the Cartesian product of non well-covered graphs. CoRR abs/1204.6681 (2012) - 2010
- [j34]Arthur S. Finbow, Douglas F. Rall:
On the packing chromatic number of some lattices. Discret. Appl. Math. 158(12): 1224-1228 (2010) - [j33]Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Limited packings in graphs. Discret. Appl. Math. 158(12): 1357-1364 (2010) - [j32]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination Game and an Imagination Strategy. SIAM J. Discret. Math. 24(3): 979-991 (2010)
2000 – 2009
- 2009
- [j31]Bostjan Bresar, Douglas F. Rall:
Fair reception and Vizing's conjecture. J. Graph Theory 61(1): 45-54 (2009) - 2008
- [j30]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall:
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008) - [j29]Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Limited Packings in Graphs. Electron. Notes Discret. Math. 30: 15-20 (2008) - [j28]Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar:
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. Electron. Notes Discret. Math. 30: 57-61 (2008) - [j27]Paul Dorbec, Michael A. Henning, Douglas F. Rall:
On the upper total domination number of Cartesian products of graphs. J. Comb. Optim. 16(1): 68-80 (2008) - 2007
- [j26]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discret. Appl. Math. 155(17): 2303-2311 (2007) - [j25]Wilfried Imrich, Sandi Klavzar, Douglas F. Rall:
Cancellation properties of products of graphs. Discret. Appl. Math. 155(17): 2362-2364 (2007) - [j24]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Dominating direct products of graphs. Discret. Math. 307(13): 1636-1642 (2007) - [j23]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Electron. Notes Discret. Math. 29: 237-241 (2007) - 2006
- [j22]Bert L. Hartnell, Douglas F. Rall:
On graphs having uniform size star factors. Australas. J Comb. 34: 305-312 (2006) - [j21]Wilfried Imrich, Douglas F. Rall:
Finite and infinite hypercubes as direct products. Australas. J Comb. 36: 83-90 (2006) - 2005
- [j20]Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall:
Bicritical domination. Discret. Math. 305(1-3): 18-32 (2005) - [j19]Douglas F. Rall:
Total Domination in Categorical Products of Graphs. Discuss. Math. Graph Theory 25(1-2): 35-44 (2005) - [j18]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Paired-domination of Cartesian products of graphs and rainbow domination. Electron. Notes Discret. Math. 22: 233-237 (2005) - [j17]Michael A. Henning, Douglas F. Rall:
On the Total Domination Number of Cartesian Products of Graphs. Graphs Comb. 21(1): 63-69 (2005) - 2004
- [j16]Bert L. Hartnell, Douglas F. Rall:
On dominating the Cartesian product of a graph and K2. Discuss. Math. Graph Theory 24(3): 389-402 (2004) - 2003
- [j15]Bert L. Hartnell, Douglas F. Rall:
Improving some bounds for dominating Cartesian products. Discuss. Math. Graph Theory 23(2): 261-272 (2003) - 2002
- [j14]Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
On k-dependent domination. Discret. Math. 249(1-3): 83-94 (2002) - 2001
- [j13]Scott P. Martin, Jeffrey S. Powell, Douglas F. Rall:
On the independence number of the Cartesian product of caterpillars. Ars Comb. 60 (2001) - 2000
- [j12]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
Acyclic domination. Discret. Math. 222(1-3): 151-165 (2000)
1990 – 1999
- 1999
- [j11]Bert L. Hartnell, Douglas F. Rall:
A bound on the size of a graph with given order and bondage number. Discret. Math. 197-198: 409-413 (1999) - 1998
- [j10]Lisa R. Markus, Douglas F. Rall:
On Seed Graphs with Two Components. Ars Comb. 49 (1998) - 1996
- [j9]Richard J. Nowakowski, Douglas F. Rall:
Associative graph products and their independence, domination and coloring numbers. Discuss. Math. Graph Theory 16(1): 53-79 (1996) - [j8]Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Star-factors and k-bounded total domination. Networks 27(3): 197-201 (1996) - [j7]Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall:
The Ultimate Categorical Independence Ratio of a Graph. SIAM J. Discret. Math. 9(2): 290-300 (1996) - 1995
- [j6]Bert L. Hartnell, Douglas F. Rall:
Vizing's conjecture and the one-half argument. Discuss. Math. Graph Theory 15(2): 205-216 (1995) - 1994
- [j5]Bert L. Hartnell, Douglas F. Rall:
Bounds on the bondage number of a graph. Discret. Math. 128(1-3): 173-177 (1994) - 1993
- [j4]Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. Discret. Appl. Math. 46(2): 167-172 (1993) - 1990
- [j3]Douglas F. Rall:
Domatically critical and domatically full graphs. Discret. Math. 86(1-3): 81-87 (1990)
1980 – 1989
- 1987
- [j2]Stephen J. Dow, Douglas F. Rall, Peter J. Slater:
Convex labelings of trees. J. Graph Theory 11(1): 59-70 (1987) - 1986
- [j1]Claudine Peyrat, Douglas F. Rall, Peter J. Slater:
On iterated clique graphs with increasing diameters. J. Graph Theory 10(2): 167-171 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
