Douglas F. Rall

Orcid: 0000-0002-5482-756X

According to our database1, Douglas F. Rall authored at least 73 papers between 1986 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Packings in bipartite prisms and hypercubes.
Discret. Math., April, 2024

2023
Graphs with equal Grundy domination and independence number.
Discret. Optim., May, 2023

On Independent Domination in Direct Products.
Graphs Comb., 2023

On well-dominated direct, Cartesian and strong product graphs.
Discret. Math., 2023

Orientable domination in product-like graphs.
Discret. Appl. Math., 2023

2022
Domination in digraphs and their direct and Cartesian products.
J. Graph Theory, 2022

Correction to: On Well-Edge-Dominated Graphs.
Graphs Comb., 2022

On Well-Edge-Dominated Graphs.
Graphs Comb., 2022

On well-covered direct products.
Discuss. Math. Graph Theory, 2022

2021
On Well-Dominated Graphs.
Graphs Comb., 2021

A new framework to approach Vizing's conjecture.
Discuss. Math. Graph Theory, 2021

General d-position sets.
Ars Math. Contemp., 2021

The enclaveless competition game.
Ars Math. Contemp., 2021

2020
A survey on packing colorings.
Discuss. Math. Graph Theory, 2020

2019
Packing chromatic vertex-critical graphs.
Discret. Math. Theor. Comput. Sci., 2019

Domination game and minimal edge cuts.
Discret. Math., 2019

2018
On Well-Covered Cartesian Products.
Graphs Comb., 2018

Game total domination critical graphs.
Discret. Appl. Math., 2018

On <i>k</i>-rainbow independent domination in graphs.
Appl. Math. Comput., 2018

2017
On Minimum Identifying Codes in Some Cartesian Product Graphs.
Graphs Comb., 2017

Packing chromatic number under local changes in a graph.
Discret. Math., 2017

Trees with equal total domination and game total domination numbers.
Discret. Appl. Math., 2017

The 4/5 upper bound on the game total domination number.
Comb., 2017

Uniformly dissociated graphs.
Ars Math. Contemp., 2017

2016
Packing Chromatic Number of Base-3 Sierpiński Graphs.
Graphs Comb., 2016

Partitioning the vertex set of G to make G ☐ H an efficient open domination graph.
Discret. Math. Theor. Comput. Sci., 2016

Progress towards the total domination game -conjecture.
Discret. Math., 2016

Total dominating sequences in graphs.
Discret. Math., 2016

2015
Total Version of the Domination Game.
Graphs Comb., 2015

On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway.
Graphs Comb., 2015

Guarded subgraphs and the domination game.
Discret. Math. Theor. Comput. Sci., 2015

2014
Identifying codes of the direct product of two cliques.
Eur. J. Comb., 2014

Relating the annihilation number and the 2-domination number of a tree.
Discret. Math., 2014

Dominating sequences in graphs.
Discret. Math., 2014

2013
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities.
Graphs Comb., 2013

On graphs with disjoint dominating and 2-dominating sets.
Discuss. Math. Graph Theory, 2013

Domination game played on trees and spanning subgraphs.
Discret. Math., 2013

Rainbow domination in the lexicographic product of graphs.
Discret. Appl. Math., 2013

Domination game: Extremal families of graphs for 3/53/5-conjectures.
Discret. Appl. Math., 2013

On the Cartesian Product of Non Well-Covered Graphs.
Electron. J. Comb., 2013

2012
Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012

2010
Domination Game and an Imagination Strategy.
SIAM J. Discret. Math., 2010

On the packing chromatic number of some lattices.
Discret. Appl. Math., 2010

2009
Fair reception and Vizing's conjecture.
J. Graph Theory, 2009

2008
On the upper total domination number of Cartesian products of graphs.
J. Comb. Optim., 2008

On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs.
Electron. Notes Discret. Math., 2008

Limited Packings in Graphs.
Electron. Notes Discret. Math., 2008

Braodcast Chromatic Numbers of Graphs.
Ars Comb., 2008

2007
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
Electron. Notes Discret. Math., 2007

Dominating direct products of graphs.
Discret. Math., 2007

Cancellation properties of products of graphs.
Discret. Appl. Math., 2007

2006
Finite and infinite hypercubes as direct products.
Australas. J Comb., 2006

On graphs having uniform size star factors.
Australas. J Comb., 2006

2005
On the Total Domination Number of Cartesian Products of Graphs.
Graphs Comb., 2005

Paired-domination of Cartesian products of graphs and rainbow domination.
Electron. Notes Discret. Math., 2005

Total Domination in Categorical Products of Graphs.
Discuss. Math. Graph Theory, 2005

Bicritical domination.
Discret. Math., 2005

2004
On dominating the Cartesian product of a graph and <i>K<sub>2</sub></i>.
Discuss. Math. Graph Theory, 2004

2003
Improving some bounds for dominating Cartesian products.
Discuss. Math. Graph Theory, 2003

2002
On <i>k</i>-dependent domination.
Discret. Math., 2002

2001
On the independence number of the Cartesian product of caterpillars.
Ars Comb., 2001

2000
Acyclic domination.
Discret. Math., 2000

1999
A bound on the size of a graph with given order and bondage number.
Discret. Math., 1999

1998
On Seed Graphs with Two Components.
Ars Comb., 1998

1996
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discret. Math., 1996

Star-factors and k-bounded total domination.
Networks, 1996

Associative graph products and their independence, domination and coloring numbers.
Discuss. Math. Graph Theory, 1996

1995
Vizing's conjecture and the one-half argument.
Discuss. Math. Graph Theory, 1995

1994
Bounds on the bondage number of a graph.
Discret. Math., 1994

1993
Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion.
Discret. Appl. Math., 1993

1990
Domatically critical and domatically full graphs.
Discret. Math., 1990

1987
Convex labelings of trees.
J. Graph Theory, 1987

1986
On iterated clique graphs with increasing diameters.
J. Graph Theory, 1986


  Loading...