The Hanoi graph \(H_4^3\) (Q2194534): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems for Hanoi and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to determine all shortest paths in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sierpiński graphs as spanning subgraphs of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and classification of Sierpiński-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planarity of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Hanoi and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominator coloring of generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing numbers of Sierpiński‐like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in Knödel graphs and Hanoi graphs / rank
 
Normal rank

Latest revision as of 09:44, 23 July 2024

scientific article
Language Label Description Also known as
English
The Hanoi graph \(H_4^3\)
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references