ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected bipartite graph. A two-colored γ\gamma-set of GG is a minimum dominating set D∈MDS‾(G)D\in \underline{MDS}(G) that can be partitioned as D=D1∪D2D=D_1\cup D_2 with

V(G)−NG[D1]=D2,V(G)−NG[D2]=D1.V(G)-N_G[D_1]=D_2,\qquad V(G)-N_G[D_2]=D_1.

Hartnell's characterization. If V(G)V(G) can be partitioned into two-colored γ\gamma-sets, then GG is the 44-cycle or GG can be obtained from K2t,2tK_{2t,2t} by removing the edges of tt vertex-disjoint 44-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.