Coloring Hanoi and Sierpiński graphs (Q411656): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.08.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964946879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring and Counting on the Tower of Hanoi Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of the towers of hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes on the Towers of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and \(L(2,1)\)-labelings in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planarity of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average eccentricity of Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distance on the Sierpiński gasket / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Sierpiński graphs and Sierpiński gasket graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-perfect codes in Sierpiński 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: Linear-time disk-based implicit graph search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:50, 5 July 2024

scientific article
Language Label Description Also known as
English
Coloring Hanoi and Sierpiński graphs
scientific article

    Statements

    Coloring Hanoi and Sierpiński graphs (English)
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    Hanoi graphs
    0 references
    Sierpiński graphs
    0 references
    vertex-coloring
    0 references
    edge-coloring
    0 references
    total coloring
    0 references
    planarity
    0 references

    Identifiers