Bell coloring graphs: realizability and reconstruction

Given a graph $G$, the Bell $k$-coloring graph $\mathcal{B}_k(G)$ has vertices given by partitions of $V(G)$ into $k$ independent sets (allowing empty parts), with two partitions adjacent if they differ only in the placement of a single vertex. We first give a structural classification of cliques in Bell coloring graphs. We then show that all trees and all cycles arise as Bell coloring graphs, while $K_4-e$ is not a Bell coloring graph and, more generally, $K_n-e$ is not an induced subgraph of any Bell coloring graph whenever $n \geq 6$. We also prove two reconstruction results: the Bell $3$-coloring graph is a complete invariant for trees, and the Bell $n$-coloring multigraph determines any graph up to universal vertices.

💡 Research Summary

The paper introduces and studies the Bell k‑coloring graph 𝔅ₖ(G) of a base graph G. A vertex of 𝔅ₖ(G) is a stable k‑partition: a division of V(G) into k independent sets, empty parts allowed. Two partitions P and Q are adjacent if there exists a vertex v∈V(G) such that removing v from both partitions yields the same (k‑1)-partition, i.e., P−v = Q−v. The vertex v is called the responsible vertex for the edge PQ. The authors also define a multigraph version 𝔅ₖ(G) where each distinct responsible vertex contributes a parallel edge, thereby retaining more information.

The first major contribution is a complete classification of cliques in Bell coloring graphs. They distinguish S‑cliques, where all edges are realized by a single anchor vertex u, from T‑cliques, which require at least three distinct responsible vertices. Lemma 3.2 proves that an S‑clique of size ≥3 has a unique anchor. Lemma 3.3 shows that a T‑triangle necessarily has three pairwise disjoint responsible vertices. Lemma 2.5 characterizes doubly realized edges: if two distinct vertices v and w both realize the same edge, then v and w are non‑adjacent in G and the two partitions must have the form {{v,w},∅}∪R and {{v},{w}}∪R. Using these observations, Theorem 3.8 enumerates all possible clique types in any Bell coloring graph.

From the clique classification the authors derive a family of forbidden induced subgraphs. They prove that K₄−e cannot be a Bell coloring graph, and more generally, for every n ≥ 6 the graph Kₙ−e is not an induced subgraph of any Bell coloring graph (Theorem 3.10). This result shows that the structure of Bell coloring graphs is severely constrained, despite being richer than standard coloring graphs.

The paper then turns to realizability: which graphs appear as Bell coloring graphs? By relating Bell coloring graphs to matching reconfiguration graphs of triangle‑free graphs, the authors show that every tree and every cycle can be realized as 𝔅ₖ(G) for a suitable k (Theorem 4.9). The construction exploits the fact that, for triangle‑free graphs, the reconfiguration graph of matchings coincides with a Bell coloring graph, allowing the transfer of known realizability results from matchings to Bell colorings.

Two reconstruction theorems constitute the second major theme. Theorem 5.9 establishes that the map T ↦ 𝔅₃(T) is injective on the class of finite trees; that is, a tree can be uniquely recovered from its Bell 3‑coloring graph. The proof hinges on the S‑/T‑clique structure: the pattern of S‑cliques encodes the branching structure of the tree, while T‑cliques capture leaf attachments.

Finally, the authors consider the multigraph version 𝔅ₖ(G). They observe that a universal vertex (adjacent to every other vertex) creates a trivial bijection 𝔅_{k+1}(G) ≅ 𝔅ₖ(G−w). To factor out this ambiguity they define the core G∘ as the induced subgraph obtained by deleting all universal vertices. Theorem 6.7 proves that the multigraph 𝔅_{|V(G)|}(G) determines the core G∘ up to isomorphism; consequently, a graph is uniquely reconstructed from its Bell‑coloring multigraph once universal vertices are ignored.

Overall, the paper provides a comprehensive structural theory for Bell coloring graphs: (i) a precise clique taxonomy, (ii) a clear forbidden‑subgraph characterization, (iii) a full realizability result for trees and cycles, and (iv) strong reconstruction theorems both for simple and multigraph versions. These contributions deepen the connection between graph coloring, reconfiguration, and graph reconstruction, and open avenues for further exploration of Bell coloring graphs for larger k, other graph families, and algorithmic applications.