Metraipolis › archive › dc_4d8538201af3

Adjacent vertex distinguishing total chromatic number of graph products — arXiv:2609.03411

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03411
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:22.978Z
SHA-256 of the archived text
ae0bcb0d97c07737f50c992c2666da7a691209dc6ed5eb700d01867f4ba63982
Stable URL of this page
https://metraipolis.com/documento/dc_4d8538201af3

How to cite

Adjacent vertex distinguishing total chromatic number of graph products — arXiv:2609.03411 — arXiv (en), https://arxiv.org/abs/2609.03411 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4d8538201af3 (Metraipolis archive dc_4d8538201af3, sha256 ae0bcb0d97c07737f50c992c2666da7a691209dc6ed5eb700d01867f4ba63982)
BibTeX
@misc{dc4d8538201af3,
  title = {Adjacent vertex distinguishing total chromatic number of graph products — arXiv:2609.03411},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03411},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4d8538201af3; sha256 ae0bcb0d97c07737f50c992c2666da7a691209dc6ed5eb700d01867f4ba63982},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03411. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The adjacent vertex distinguishing (AVD)-total chromatic number $\chi''_{a}(G)$ of a graph $G$ is the least integer $k$ for which $G$ has a proper total coloring $f$ with $k$ colors such that $C_G(u)\neq C_G(v)$ for every edge $uv\in E(G)$, where $C_G(u)=\{f(u)\}\cup\{f(uw):uw\in E(G)\}$. The AVD-total coloring conjecture (AVD-TCC) asserts that $\chi''_{a}(G)\leq \Delta(G)+3$ for every simple graph $G$, where $\Delta(G)$ is the maximum degree of $G$. In this paper, we prove the AVD-TCC for certain classes of graph products, including Cartesian products, lexicographic products, skew products, cover products, comb products, and Indu--Bala products.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.03411 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:09:21.178Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).