On a theorem about vertex colorings of graphs

DOI10.1016/0012-365X(87)90243-3zbMATH Open0625.05021OpenAlexW1979074854MaRDI QIDQ579272FDOQ579272

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1885944
• A generalization of edge-coloring in graphs
• Coloring graphs with sparse neighborhoods
• Coloring graphs with locally few colors
• Colouring a graph frugally

zbMATH Keywords

vertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cited In (13)

• An Erdős-Gallai type theorem for vertex colored graphs
• Problems and results on judicious partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A map colour theorem for the union of graphs
• Majority choosability of countable graphs
• The vertex coloring problem and its generalizations
• Judicious partitions of graphs
• Partitioning a graph into alliance free sets
• Satisfactory graph partition, variants, and generalizations
• Title not available (Why is that?)
• A structural theorem on embedded graphs and its application to colorings
• Revisiting a theorem by Folkman on graph colouring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579272)