Coloring Hanoi and Sierpiński graphs

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.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 312; no. 9; pp. 1521 - 1535
Main Authors Hinz, Andreas M., Parisse, Daniele
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.05.2012
Subjects
Classification
Coloring
Edge-coloring
Graphs
Hanoi graphs
Mathematical analysis
Planarity
Proving
Sierpiński graphs
Total coloring
Vertex-coloring
Edge-coloring
Total coloring
Vertex-coloring
Planarity
Sierpiński graphs
Hanoi graphs
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2011.08.019