Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09154

Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs

Mauro Lucci·Graciela Nasini·Paola Tolomei·Luis Miguel Torres
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Double-Partition Coloring Problem (DPCP) is a recently introduced generalization of several coloring problems on graphs and hypergraphs, including the Partition Coloring Problem, the List Coloring Problem, and the Conflict-Free Coloring Problem (CFCP). In this work, we further investigate the structural and computational properties of the DPCP and develop exact and heuristic solution approaches. We derive structural results that allow the detection of infeasible instances and the reduction of their size. We propose one-step and two-step heuristics for obtaining high-quality solutions. These procedures are incorporated into an enhanced branch-and-price algorithm based on a set covering formulation of the DPCP. The algorithm further includes new strategies for solving the NP-hard pricing problem. Computational experiments show that the proposed branch-and-price algorithm and a compact integer programming formulation complement each other: while the compact formulation is generally more effective on sparse instances, branch-and-price performs particularly well on denser and larger instances. In particular, these are the first exact algorithms to be computationally evaluated on various CFCP instances.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mauro Lucci, Graciela Nasini, Paola Tolomei, Luis Miguel Torres. 2026-10-06. Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs. https://arxiv.org/abs/2610.09154

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Notes on the Divisibility of Divisor Sums of Catalan Numbers

We investigate divisibility questions for the sum-of-divisors function $σ(C_n)$ of the Catalan numbers $C_n=(n+1)^{-1}\binom{2n}{n}$. Using the prime factors occurring to exponent one in $C_n$, we give explicit divisors of $σ(C_n)$ and obtain, for each fixed integer $m\geq 2$, a power $m^{R_m(n)}$ dividing $σ(C_n)$, with $R_m(n)\sim\frac{2\log 2}{φ(m)}\frac{n}{\log n}$. We further prove uniform divisibility for all moduli up to fixed powers of $\log n$ and, with the same leading constant $2\log 2$, for almost all moduli up to $\sqrt{n}$ apart from logarithmic factors. We also establish a complete classification of the integers $m\geq 2$ for which $m\midσ(mk-1)$ for every $k\geq 1$, identify precisely the exceptional coprimality relations among the associated linear forms, and record a twin-prime product divisor of $σ(C_n)$. The arguments use standard prime-distribution results and do not assume any conjecture concerning twin primes.

math.CO↗
arXiv2026

Sign-coherence and tropical sign pattern for rank $3$ real cluster-cyclic exchange matrices

The sign-coherence about $c$-vectors was conjectured by Fomin-Zelevinsky and proved by Gross-Hacking-Keel-Kontsevich for integer skew-symmetrizable case. We prove this conjecture associated with $c$-vectors for rank 3 real cluster-cyclic skew-symmetrizable case. Simultaneously, we establish their self-contained recursion and monotonicity. Then, these $c$-vectors are proved to be roots of certain quadratic equations. Based on these results, we prove that the corresponding exchange graphs of $C$-pattern and $G$-pattern are $3$-regular trees. We also study the structure of tropical signs and equip the dihedral group $\mathrm{D}_6$ with a cluster realization via certain mutations.

math.CO↗
arXiv2026

Subexponential upper bound on the number of rich words

Let $R_q(n)$ denote the number of rich words of length $n$ over a fixed alphabet of size $q\geq2$. It is known that $R_q(n)^{1/n}\to1$. We establish a nonrecursive subexponential upper bound on the number of rich words, with its asymptotic growth quantified in terms of an iterated logarithm. For every $λ\in(1/2,1)$ and $γ>1$, there exists $c>0$ such that, for every positive function $ϕ$ satisfying $ϕ(n)\to\infty$ and $n/ϕ(n)\to\infty$, the functions \[ f(n)=\left[c\ln^{*}\!\left(\frac{n}{ϕ(n)}\ln q\right)\right]^{1/γ}, \qquad B(n)=q^{\frac{n}{ϕ(n)}+\frac{n}{(2λ)^{f(n)-1}}} \] satisfy $R_q(n)\leq B(n)$ for all sufficiently large $n$ and $B(n)^{1/n}\to1$. Here $\ln^{*}$ is the iterated natural logarithm, with value zero on $(0,1]$. The proof iterates a counting inequality based on palindromic factorization and controls the resulting multiplicative constants using the iterated logarithm.

math.CO↗