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