The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices are ...
The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific ...
The Monthly publishes articles, as well as notes and other features, about mathematics and the profession. Its readers span a broad spectrum of mathematical interests, and include professional ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback