5 citations · 12 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
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…