Skip to content

Author

Nandana K Vasudevan

We have 2 of 4 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Elementary graphs are chromatic-choosable

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 graphs are one of the two basic classes in the Chv\'atal--Sbihi decomposition of claw-free perfect graphs; they include all line graphs of bipart...

N. Narayanan, Nandana K. Vasudevan, K. Somasundaram · 0 citations
Review Jun 2026

List-Coloring and Chromatic-Choosability -- A Dynamic Survey

List-coloring, introduced independently by Vizing and by Erd\H{o}s, Rubin, and Taylor in the 1970s, generalizes ordinary vertex coloring by assigning to each vertex its own set of admissible colors. A graph is chromatic-choosable if its list chromatic number equals its chromatic number. The previous survey on list-colo...

Nandana K Vasudevan, K. Somasundaram, N. Narayanan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.