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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results