Graph colouring and irregularity strength represent two complementary strands of graph-labelling theory with deep roots in combinatorial optimisation and practical implications for network design, ...

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...

"I plan to continue researching graph coloring problems, focusing on exploring packing colorings via additional methodologies such as the Combinatorial Nullstellensatz and probabilistic methods. "By ...

Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...

constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs can be used to solve problems such as graph-coloring: ...

In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible. A paper posted online last month has disproved a ...