Domination conjecture for triangulations with finitely many non-six-valent vertices
Statement
A triangulation is a plane graph in which every face, including the outer face, is bounded by a triangle. The degree of a vertex is its number of incident edges. The bounded-exception domination conjecture. For every constant , there exists an integer such that every -vertex triangulation with at most vertices whose degree is not , and with , has a dominating set of size at most . This extends the paper's maximum-degree-six result to triangulations that are degree six except at a bounded number of vertices; the supplied text does not resolve it.
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.