Back close

Every Elementary Graph is Chromatic Choosable

Publication Type : Journal Article

Publisher : arXiv preprint arXiv:2312.00430

Source : arXiv preprint arXiv:2312.00430, 2023.

Url :

Campus : Coimbatore

School : School of Physical Sciences

Department : Mathematics

Year : 2023

Abstract : Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced P3 get distinct colors. They constitute a subclass of the class of claw-free perfect graphs. In this paper, we show that for any elementary graph, its list chromatic number and chromatic number are equal.

Cite this Research Publication : NK Vasudevan, K Somasundaram, J Geetha, "Every Elementary Graph is Chromatic Choosable," arXiv preprint arXiv:2312.00430, 2023.

Admissions Apply Now