The asymptotic weighted domination bound for connected subcubic planar graphs
Statement
Let be a connected subcubic planar graph, and for let denote the number of vertices of degree in . Let denote the domination number of . The conjectured optimal bound. There exists a constant such that every such graph with at least vertices satisfies
The conjecture is motivated by a constructed family showing that the coefficient on would make the paper's upper bound tight. The source gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.