2 search results - page 1 / 1 » List Colouring Squares of Planar Graphs |
ENDM
2007
14 years 10 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...