Odd Chromatic Number of Graph Classes

Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler +1

A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, o…