Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Daneels, Matias"'
An injective colouring of a graph is a colouring in which every two vertices sharing a common neighbour receive a different colour. Chen, Hahn, Raspaud and Wang conjectured that every planar graph of maximum degree $\Delta \ge 3$ admits an injective
Externí odkaz:
http://arxiv.org/abs/2412.09969
