A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs

L Faria, M Nigro, D Sasaki - Discrete Optimization, 2025 - Elsevier
Abstract In 1988, Chetwynd and Hilton observed that a (Δ+ 1)-total coloring induces a vertex
coloring in the graph, they called it conformable. A (Δ+ 1)-vertex coloring of a graph G=(V, E) …

Total coloring of dihedral graphs

W Zhang, S Song - Proceedings of the 2024 International Conference on …, 2024 - dl.acm.org
Total coloring of dihedral graphs Page 1 Total coloring of dihedral graphs Wenzhe Zhang
School of Mathematics and Information Science Yantai University Yantai, Shandong, China …

Total coloring of 4-regular circulant graphs and Abelian graphs

Y Chen, S Song - 2024 7th International Conference on …, 2024 - ieeexplore.ieee.org
In this paper, we study the total chromatic numbers of three families of Cayley graphs. We
proved that the 4-regular circulant graph C_4n(1,4) for any integer n\gt2 and C_4λn(1,n) for …

Aspectos gerais sobre a conformabilidade de grafos

A Junior, M Nigro - 2023 - bdtd.uerj.br
Aspectos gerais sobre a conformabilidade de grafos Page 1 Universidade do Estado do Rio de
Janeiro Centro de Tecnologia e Ciências Instituto de Matemática e Estatística Mauro Nigro Alves …