In finite group theory, the order of an element—defined as the least positive integer n for which the nth power of the element equals the identity—serves as a fundamental invariant linking group ...

Total colouring addresses the problem of assigning colours simultaneously to the vertices and edges of a graph so that no two adjacent or incident elements share the same colour. Introduced in the ...