Every Elementary Graph is Chromatic Choosable

NK Vasudevan, K Somasundaram, J Geetha - arXiv preprint arXiv …, 2023 - arxiv.org
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 …

[引用][C] The Choosability of the Order-2 Sudoku Graph

E Miller