Publication:4873220
From MaRDI portal
zbMath0855.05055MaRDI QIDQ4873220
Publication date: 28 May 1996
chromatic number; vertex colouring; list chromatic number; Euclidean distance; graph parameters; choice number; plane unit-distance graph
05C15: Coloring of graphs and hypergraphs
Related Items
On weight choosabilities of graphs with bounded maximum average degree, Homomorphisms from sparse graphs to the Petersen graph, Decomposing a graph into forests, On the neighbour sum distinguishing index of graphs with bounded maximum average degree, Partitioning sparse graphs into an independent set and a forest of bounded degree, A Brooks type theorem for the maximum local edge connectivity, \(L(p,q)\)-labeling of sparse graphs, Coloring squares of graphs with mad constraints, On the total neighbour sum distinguishing index of graphs with bounded maximum average degree, Incidence coloring of graphs with high maximum average degree, QUBO formulations of the longest path problem, Semialgebraic graphs having countable list-chromatic numbers, Vertex Partitions of Graphs into Cographs and Stars, Vizing's coloring algorithm and the fan number, Hypergraph list coloring and Euclidean Ramsey theory