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 ...
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, ...
If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results