3 papers
math.CO2026
Elementary graphs are chromatic-choosable
Narayanan N, Nandana K. Vasudevan, K. Somasundaram
A graph is \emph{elementary} if its edges can be coloured with two colours so that the two edges of every induced path on three vertices receive different colours. Elementary graph…
math.CO2026
List-Coloring and Chromatic-Choosability -- A Dynamic Survey
Nandana K Vasudevan, K Somasundaram, N Narayanan
List-coloring, introduced independently by Vizing and by Erdős, Rubin, and Taylor in the 1970s, generalizes ordinary vertex coloring by assigning to each vertex its own set of admi…
math.CO2023
Every Elementary Graph is Chromatic Choosable
Nandana K Vasudevan, K Somasundaram, J Geetha
Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced get distinct colors. They constitute a subclass of the cl…