Dennis Epple

Abstract: A $(k,l)$-colouring of a graph is a partition of its vertex set into $k$ independent sets and $l$ cliques. The bichromatic number $\\chi^b$ of a graph is theminimum $r$, such that the graph is $(k,l)$-colourable for all $k+l=r$.The...