Article ID Journal Published Year Pages File Type
8903423 Electronic Notes in Discrete Mathematics 2017 9 Pages PDF
Abstract
We list some unsolved problems concerning two meanwhile famous classes of graphs, namely the Hanoi graphs and the Sierpiński graphs. Whereas many graph parameters have been determined and metric properties are well-understood for the latter, the former give rise to notoriously difficult questions, in particular when it comes to distance-related tasks.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,