Hartnell's characterization of bipartite graphs partitionable into two-colored domination sets
Statement
Let be a connected bipartite graph. A two-colored -set of is a minimum dominating set that can be partitioned as with
Hartnell's characterization. If can be partitioned into two-colored -sets, then is the -cycle or can be obtained from by removing the edges of vertex-disjoint -cycles.
This gives a proposed structural characterization of connected bipartite graphs whose vertex sets admit such a partition. The supplied source does not state whether the characterization has been proved or remains open.
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.