| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648312 | Discrete Mathematics | 2012 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andreas M. Hinz, Daniele Parisse,