Efficient total coloring of cubic maps of girth 4

Abstract: Let $2\le k\in\mathbb{Z}$. A total coloring of a $k$-regular simple graph via $k+1$ colors is an efficient total coloring if each color yields an efficient dominating set, where the 3-cube efficient domination condition applies to the restriction of each color class to the vertex set. Focus was set upon graphs of girth $k+1$ with efficient total colorings of finite simple cubic graphs $Γ$ of girth 4 built up from the 3-cube and leading to a conjecture that all of those colorings were obtained by means of four basic operations. In the present work, a fifth basic operation is found necessary in terms of combinatorial cubic maps $M(Γ)$ of which the graphs $Γ$ are their 1-skeletons. This takes to conjecturing that any simple cubic graph that is toroidally 3-edge-connected (defined in the work) and whose $\ell$-belts have $\ell\equiv 0$ mod 4 has an efficient total coloring.

• The paper introduces efficient total coloring (ETC) for cubic graphs of girth 4 by ensuring each color class forms an efficient dominating set.
• It develops five atomic operations—spray, extension, unfolding, exchange, and amalgam—to construct and classify ETCs under strict combinatorial and topological conditions.
• The study highlights that optimal ETCs require all belts to be divisible by 4 and links their existence to global properties like toroidal 3-edge connectivity.

Efficient Total Coloring of Cubic Maps with Girth 4

Problem Statement and Framework

The paper addresses efficient total colorings (ETCs) of finite simple cubic graphs of girth 4, focusing on the intersection of total coloring, efficient domination, and combinatorial embeddings on compact surfaces. Given the total coloring conjecture (Behzad-Vizing), the challenge lies not only in assigning a minimal color set to vertices and edges (so that no incident/adjacent elements share a color), but in enforcing that each color class forms an efficient dominating set (EDS). Here, “efficient” refers to a perfect code–each vertex outside the set is dominated (in the closed neighborhood sense) by exactly one vertex in the set.

The author leverages structural properties of cubic graphs (degree 3), maps with cycles of prescribed lengths (girth and belt conditions), and topological embeddings (planar, toroidal, or higher genus) to constructively analyze when an ETC of order 4 is realized. Practically, such colorings have implications for perfect codes, orthogonality in colorings, and combinatorial tessellations.

Definitions and Main Notions

A $k$-regular graph $\Gamma$ admits an efficient total coloring (ETC) with $k+1$ colors if each color class is an EDS, i.e., a stable set where non-members are adjacent to exactly one member. For cubic graphs ($k=3$), the focus is on ETCs with 4 colors. A vertex-edge-girth coloring (VEGC) further constrains the coloring to ensure each girth-4 cycle (fundamental cycle of length 4) is colored so that both the set of its vertices and the set of its edges receive each of the 4 colors exactly once. If this ETC also meets the VEGC restriction, it is termed an “efficient total girth coloring (ETGC).”

Other critical definitions introduced include:

• Edge-girth coloring (EGC): directs attention to prism extensions and compatibility of edge colorings under Cartesian products, laying groundwork for higher-dimensional analogs and orthogonality.
• Belt structure: “$\ell$-belts” are cycles delimiting faces in the map embedding. The paper demonstrates that only graphs whose belts all have lengths divisible by 4 can support ETCs.

Constructive Methods and Operations

A significant contribution is the operational framework developed for generating all graphs with an ETC of the desired form, rooted in five atomic operations:

1. Spray: Assigns colors to the neighborhoods in such a way that the coloring propagates deterministically, initializing from a girth-4 cycle. This mechanism provides the basic procedure for the smallest example (the 3-cube, $Q_3$), and extends to prisms via structural recursion.
2. Extension: Stacking or joining cutouts of maps along boundaries, serving as a mechanism for building larger or periodic graphs from small ETCed subgraphs.
3. Unfolding: Replaces a 4-belt with larger subgraphs (such as $P_2 \square P_{2\ell}$), generalizing the local expansion process while preserving girth and cubicity.
4. Exchange: Locally reroutes edges within a 4-cycle, effectively replacing a pair of parallel edges with a pair of alternate chords forming a $K_{2,2}$. This operation is particularly relevant for incrementing genus in embedded maps without introducing belts of size not divisible by 4.
5. Amalgam: Glues together two cutouts (or the same one with itself) along a common cycle to form larger or more topologically intricate graphs, controlling the belt structure at the interface.

The interplay of these operations underlies the main conjecture: Any finite connected simple cubic graph of girth 4 admitting an ETC can be obtained from the 3-cube by a sequence of spray, extension, unfolding, exchange, and amalgam operations. This expands a previous (four-operation) classification and resolves new cases observed in the combinatorics of cubic maps.

Topological Constraints and Genus

A central structural theorem established is that if a cubic graph $\Gamma$ of girth 4 admits an ETC with 4 colors, then both the vertex count and all belt lengths must be divisible by 4. The existence of ETCs is shown to be tightly linked not merely to local cycle structure but to the global embedding (i.e., the combinatorial map derived from $\Gamma$ as the 1-skeleton of a surface embedding).

The most substantial topological insight is formalized as a conjecture: If $\Gamma$0 is toroidally 3-edge-connected and all belt lengths are divisible by 4, then $\Gamma$1 admits an ETC. The introduction of toroidal 3-edge connection (i.e., some planar representation is at least 3-edge-connected) is motivated by the construction of amalgams which, in degenerate instances, can violate ETC existence despite all belts being appropriately sized.

The exchange operation is analyzed as one that can increase the genus while preserving the requisite belt parity structure, providing a mechanism to construct higher-genus examples supporting ETCs under the conjectured framework.

Numerical Illustrations and Specific Families

The paper supplies explicit colorings and combinatorial constructions for families of graphs:

• The 3-cube ($\Gamma$2) is presented as the minimal supporting graph, providing two orthogonal ETGCs that extend to the 4-cube under the prism operation.
• Prisms $\Gamma$3 (cycle graphs crossed with $\Gamma$4) are confirmed to admit mutually orthogonal ETCs, supporting both extension and unfolding operations.
• Specific tilings (the truncated square tiling, etc.) are analyzed for their robust ETC structure under extension, re-emphasizing the role of belt parity and global connectivity.
• Genus-increment phenomena are illustrated, and the method of exchanges is used to show that higher genus (toroidal or beyond) graphs can be generated constructively from lower genus graphs.

Implications and Future Directions

The operational framework for ETC construction not only gives a method for generating all known such colorings for cubic graphs of girth 4, but also advances a recipe for identifying potential obstructions when extending to new graphs. The appearance of the fifth operation (amalgam) in the classification points to subtle topological-cyclic dependencies not anticipated in more restrictive planar or toroidal constructions.

Strong and testable claims in the paper include:

• For cubic graphs of girth 4, all belts divisible by four is a necessary condition for the existence of a 4-color ETC.
• Toroidally 3-edge connected graphs with this belt property always support such colorings (conjectured, with some supporting evidence).
• The five mechanisms enumerated suffice for the constructive generation of all such graphs, modulo the belt and connectivity restrictions.

The results tie efficient domination, total colorings, and topological embeddings together, and invite further study in several directions:

• Extension of these definitions to higher degree regular graphs and maps of higher genus.
• Exploration of the computational complexity of verifying the sufficient conditions (including potential polyhedral/graph minor methods for toroidal 3-edge connectivity).
• Investigation of ETCs with additional combinatorial constraints (e.g., further symmetries, chromatic invariants, or orthogonality relations).

Conclusion

The paper achieves an overview of combinatorial coloring theory, perfect codes, and topological graph theory by isolating precise conditions and generative mechanisms for efficient total colorings of cubic graphs with girth 4. The introduction of the fifth amalgam operation refines the constructive framework needed for full classification, and the interplay of local coloring properties with global embedding structure advances the theoretical understanding of color-critical graphs on surfaces. The conjectures and methods proposed provide a tangible pathway for advancing the study of efficient colorings in both finite and infinite classes of regular graphs embedded on surfaces of arbitrary genus.