List Coloring of the Unitary Divisor Graphs

This paper studies the list coloring properties of divisor graphs and important variants, with emphasis on unitary divisor graphs and unitary prime divisor graphs (the unitary coprime divisor graph coincides with the unitary divisor graph). In list coloring, each vertex receives a list of permissible colors and a proper coloring selects one color from each list so that adjacent vertices receive different colors. The work compares the chromatic number and list chromatic number for selected divisor-based graphs and presents explicit graph constructions and list-coloring examples. For \(\operatorname{UDG}(n)\) with \(r\) distinct prime factors, it is shown that \(\chi(\operatorname{UDG}(n))=r+1\) and \(r+1 \leq \chi_{\ell}(\operatorname{UDG}(n)) \leq 2^r\), with \(\chi_{\ell}(\operatorname{UDG}(n))=r+1\) whenever \(r \leq 4\). An illustrative encoding of a small timetabling problem is also given, where vertices represent teachers, edges represent declared conflicts, and colors represent available time periods. The study illustrates how arithmetic structure and list-coloring constraints can be combined to encode availability restrictions.

Authors

Institutions

Publication Details

Journal
Asian Research Journal of Mathematics
Published
2026-11-12
DOI
https://doi.org/10.9734/arjom/2026/v22i111186
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

List Coloring of the Unitary Divisor Graphs

G. Thamizhendhi, V. Abirami
Asian Research Journal of Mathematics
Advanced Graph Theory Research
article

List Coloring of the Unitary Divisor Graphs

G. Thamizhendhi, V. Abirami
article en

Abstract

This paper studies the list coloring properties of divisor graphs and important variants, with emphasis on unitary divisor graphs and unitary prime divisor graphs (the unitary coprime divisor graph coincides with the unitary divisor graph). In list coloring, each vertex receives a list of permissible colors and a proper coloring selects one color from each list so that adjacent vertices receive different colors. The work compares the chromatic number and list chromatic number for selected divisor-based graphs and presents explicit graph constructions and list-coloring examples. For \(\operatorname{UDG}(n)\) with \(r\) distinct prime factors, it is shown that \(\chi(\operatorname{UDG}(n))=r+1\) and \(r+1 \leq \chi_{\ell}(\operatorname{UDG}(n)) \leq 2^r\), with \(\chi_{\ell}(\operatorname{UDG}(n))=r+1\) whenever \(r \leq 4\). An illustrative encoding of a small timetabling problem is also given, where vertices represent teachers, edges represent declared conflicts, and colors represent available time periods. The study illustrates how arithmetic structure and list-coloring constraints can be combined to encode availability restrictions.

Asian Research Journal of MathematicsVol. 22(11)
Tamilnadu State Council for Science and Technology (IN)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon