Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...
Sierpiftski graphs S(n,3) are the graphs of the Tower of Hanoi puzzle with n disks, while Sierpiftski gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback