Rall's complete-factor conjecture for well-dominated Cartesian products
Let and be nontrivial connected graphs, and let denote their Cartesian product. A graph is well-dominated if every minimal dominating set is a minimum dominating set.
Rall's conjecture. If is well-dominated, then at least one of or is a complete graph.
This conjecture is the explicit final formulation of the proposed classification of connected well-dominated Cartesian products. The paper proves the corresponding characterization when one factor is complete, but the assertion for arbitrary connected factors remains open.
References
- Douglas F. Rall, “On well-dominated direct, Cartesian and strong product graphs”, arXiv:2105.09797 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.