M. Voigt, List colourings of planar graphs, Discrete Math. 120 (1993) 215-219.Margit Voigt.List colorings of planar graph,1993Voigt, M.: List colourings of planar graphs. Discrete Math., 120, 215-219 (1993)M. Voigt, List colourings of planar graphs, Discrete Math., 120(1-3):215...
A graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex v is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(v) have the cardinality k and G is L-list colou...
Section 4 is about planar and related graphs. Section 5 is also about planar and related graphs, but this time with additional constraints imposed on the lists. 1 Introduction List colourings of graphs were introduced independently by Vizing [61], by Erd? os, Rubin and Taylor [15], and, ...
For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different colors. It is already known that planar graphs of girth at ...
We prove that the on-line version of Ohba's conjecture is true in the class of planar graphs. We also consider several alternate on-line list colouring models.doi:10.48550/arXiv.1502.02557Derka, MartinLópezOrtiz, AlejandroMaftuleac, Daniela...
407 colour color, coloration, colorations, colored, coloreds, colorful, colorfully, coloring, colorings, colorless, colors, colouration, colourations, coloured, coloureds, colourful, colourfully, colouring, colourings, colourist, colourists, colourless, colours Y N 408 normal normalisation, normalise...
摘要: The concept of reducibility is closely related to list colorings and choosability. The main result of this paper states that a bipartite graph G is U -reducible for every set U if and only if G is 2-choosable.关键词: Theoretical or Mathematical/ graph colouring/ list colorings ...
Summary: This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph $k$-colouring problem. Its strength lies in reducing the number of neighbors that need to be c... I Juhos,A Tóth,JIV Hemert,... - Springer 被引...
Adapted list colouring of planar graphsdoi:10.1002/jgt.20391adapted coloringlist coloringplanar graphsGiven an edge coloring F of a graph G, a vertex coloring of G is adapted to F if no color appears at the same time on an edge and on its two endpoints. If for some integer k, a graph...
In 1977, Wegner conjectured that the chromatic number of the square of every\nplanar graph $G$ with maximum degree $\\Delta\\ge8$ is at most\n$\\bigl\\lfloor\\frac32\\Delta\\bigrfloor+1$. We show that it is at most $\\frac32\n\\Delta (1+o(1))$ (where the $o(1)$ ...