On a theorem about vertex colorings of graphs

DOI10.1016/0012-365X(87)90243-3zbMath0625.05021OpenAlexW1979074854MaRDI QIDQ579272

Claudio Bernardi

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90243-3

zbMATH Keywords

vertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Problems and results on judicious partitions ⋮ Majority choosability of countable graphs ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Partitioning a graph into alliance free sets ⋮ Judicious partitions of graphs

Cites Work

• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Covering the vertex set of a graph with subgraphs of smaller degree

This page was built for publication: On a theorem about vertex colorings of graphs