# Every Elementary Graph is Chromatic Choosable

Source: [Every Elementary Graph is Chromatic Choosable](<https://www.sota2.com/research/paper/68fa5b291e209131ce9c5f47>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:07.208Z

Authors: Nandana K Vasudevan, K Somasundaram, J Geetha

Published: 2023-12-01T08:54:21.000Z

## Abstract

Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced $P\_3$ 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2312.00430>)

[PDF](<https://arxiv.org/pdf/2312.00430.pdf>)