Improved lower bounds on parity vertex colourings of binary trees

Jan Soukup

A vertex colouring is called a \emph{parity vertex colouring} if every path in $G$ contains an odd number of occurrences of some colour. Let ${\chi }_p(G)$ be the minimal number of col…