Coloring the square of Sierpiński graphs
From MaRDI portal
Publication:497382
DOI10.1007/s00373-014-1444-yzbMath1321.05095OpenAlexW2097907293MaRDI QIDQ497382
Bing Xue, Lian-Cui Zuo, Guo Jun Li
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1444-y
Related Items
Metric properties of Sierpiński-like graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring Hanoi and Sierpiński graphs
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- The hub number of Sierpiński-like graphs
- Hamming dimension of a graph-the case of Sierpiński graphs
- On the planarity of Hanoi graphs
- Coloring the square of the Cartesian product of two cycles
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The tower of Hanoi
- The average eccentricity of Sierpiński graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring squares of planar graphs with girth six
- Coloring the square of an outerplanar graph
- A bound on the chromatic number of the square of a planar graph
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- The Tower of Hanoi – Myths and Maths
- Decomposing complete equipartite graphs into short even cycles
- Coloring and Counting on the Tower of Hanoi Graphs
- List Colouring Squares of Planar Graphs
- A statistical analysis of the towers of hanoi problem
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Equitable Coloring
- Coloring the square of a planar graph
- 1-perfect codes in Sierpiński graphs
- On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
- Pascal's Triangle and the Tower of Hanoi
- Perfect Graphs and an Application to Optimizing Municipal Services
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
