Connected domination conjecture for plane triangulations
Connected domination conjecture for plane triangulations
Let be a plane triangulation of sufficiently large order . A connected dominating set is a subset such that and is connected; let denote the minimum cardinality of a connected dominating set.
Connected domination conjecture.
The paper constructs plane triangulations with , so this weaker bound is presented as a revised conjecture; the supplied status evidence says it remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Kengo Enami, Naoki Matsumoto and Takamasa Yashima, “Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets”, arXiv:2506.10471 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.