Odd chromatic number of graph classes

Abstract 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, or into an odd and an even induced subgraph. We refer to a partition into odd subgraphs as an odd colouring of . Scott proved that a connected graph admits an odd colouring if and only if it has an even number of vertices. We say that a graph is ‐odd colourable if it can be partitioned into at most odd induced subgraphs. The odd chromatic number of , denoted by , is the minimum integer for which is ‐odd colourable. We initiate the systematic study of odd colouring and odd chromatic number of graph classes. We first consider a question due to Scott, which states that every graph of even order has , for some positive constant , by proving that this is indeed the case if is restricted to having girth at least seven. We also show that any graph whose all components have even order satisfies , where is the maximum degree of . Next, we show that certain interesting classes have bounded odd chromatic number. Our main results in this direction are that interval graphs, graphs of bounded modular‐width all have bounded odd chromatic number. In particular, every even interval graph is 6‐odd colourable, and every even graph is ‐odd colourable, where is the modular width of a graph.