The following pages link to Douglas F. Rall (Q267174):
Displaying 50 items.
- Total dominating sequences in graphs (Q267175) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- Total version of the domination game (Q497340) (← links)
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
- Packing chromatic number under local changes in a graph (Q512610) (← links)
- Graphs whose vertex independence number is unaffected by single edge addition or deletion (Q689974) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Rainbow domination in graphs (Q928382) (← links)
- Distance-balanced graphs (Q938213) (← links)
- On the upper total domination number of Cartesian products of graphs (Q941836) (← links)
- On the packing chromatic number of some lattices (Q987667) (← links)
- Limited packings in graphs (Q987685) (← links)
- Secondary domination in graphs (Q1011873) (← links)
- A class of rings which are algebraic over the integers (Q1135337) (← links)
- Domatically critical and domatically full graphs (Q1174128) (← links)
- A bound on the size of a graph with given order and bondage number (Q1292849) (← links)
- Bounds on the bondage number of a graph (Q1322182) (← links)
- (Q1579558) (redirect page) (← links)
- Acyclic domination (Q1579559) (← links)
- On \(k\)-dependent domination (Q1598844) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- The 4/5 upper bound on the game total domination number (Q1705814) (← links)
- Domination game and minimal edge cuts (Q1727767) (← links)
- On well-covered Cartesian products (Q1756093) (← links)
- On the total domination number of Cartesian products of graphs (Q1777233) (← links)
- Game total domination critical graphs (Q1801040) (← links)
- Domination game played on trees and spanning subgraphs (Q1946659) (← links)
- On the Cartesian product of non well-covered graphs (Q1953503) (← links)
- Correction to: ``On well-edge-dominated graphs'' (Q2084786) (← links)
- On well-dominated direct, Cartesian and strong product graphs (Q2092407) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- On well-covered direct products (Q2118250) (← links)
- A survey on packing colorings (Q2194523) (← links)
- On \(k\)-rainbow independent domination in graphs (Q2335156) (← links)
- Trees with equal total domination and game total domination numbers (Q2357775) (← links)
- On graphs having maximal independent sets of exactly \(t\) distinct cardinalities (Q2376089) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Domination game: extremal families of graphs for \(3/5\)-conjectures (Q2446309) (← links)
- Rainbow domination in the lexicographic product of graphs (Q2446857) (← links)
- Cancellation properties of products of graphs (Q2457017) (← links)
- Bicritical domination (Q2581401) (← links)
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture (Q2629270) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- A new framework to approach Vizing's conjecture (Q2656331) (← links)
- On well-dominated graphs (Q2657074) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- On independent domination in direct products (Q2680574) (← links)
