scientific article; zbMATH DE number 866055
From MaRDI portal
Publication:4873220
zbMath0855.05055MaRDI QIDQ4873220
Publication date: 28 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
chromatic numbervertex colouringlist chromatic numberEuclidean distancegraph parameterschoice numberplane unit-distance graph
Related Items (15)
QUBO formulations of the longest path problem ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ \(L(p,q)\)-labeling of sparse graphs ⋮ On weight choosabilities 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 ⋮ Coloring squares of graphs with mad constraints ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ Vizing's coloring algorithm and the fan number ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Hypergraph list coloring and Euclidean Ramsey theory ⋮ Decomposing a graph into forests ⋮ Vertex Partitions of Graphs into Cographs and Stars ⋮ Incidence coloring of graphs with high maximum average degree
This page was built for publication: