Title of article :
Coloring Hanoi and Sierpiński graphs
Author/Authors :
Hinz، نويسنده , , Andreas M. and Parisse، نويسنده , , Daniele، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
Abstract :
It is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively. New proofs for their classification with respect to planarity are also given.
Keywords :
Edge-coloring , total coloring , planarity , Hanoi graphs , vertex-coloring , Sierpi?ski graphs
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
