Odd Colourings of Graph Products

arXiv2202.12882MaRDI QIDQ6392183FDOQ6392183

Vida Dujmović, Saeed Odak, Pat Morin

Publication date: 25 February 2022

Abstract: The odd colouring number is a new graph parameter introduced by Petruv{s}evski and v{S}krekovski. In this note, we show that graphs with so called product structure have bounded odd-colouring number. By known results on the product structure of $k$-planar graphs, this implies that $k$-planar graphs have bounded odd-colouring number, which answers a question of Cranston, Lafferty, and Song.

This page was built for publication: Odd Colourings of Graph Products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392183)