The hamiltonicity and path t-coloring of Sierpiński-like graphs
From MaRDI portal
Publication:444448
Recommendations
- On Hamiltonian colorings of graphs
- On Hamiltonian colorings for some graphs
- Hamiltonian colorings of graphs
- The Hamilton-connectivity and the coloring of \(r\)-Klee-graphs
- scientific article; zbMATH DE number 2170468
- Publication:4952612
- Hamiltonicity and colorings of arrangement graphs
- On Hamiltonian-colored graphs
- Hamiltonian paths in Cayley color graphs
- Hamiltonicity and generalised total colourings of planar graphs
Cites work
- scientific article; zbMATH DE number 416858 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1846807 (Why is no real title available?)
- 1-perfect codes in Sierpiński graphs
- A 2-parametric generalization of Sierpiński gasket graphs.
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Coloring Hanoi and Sierpiński graphs
- Covering codes in Sierpiński graphs
- Crossing numbers of Sierpiński‐like graphs
- Equitable \(L(2,1)\)-labelings of Sierpiński graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- On the linear vertex-arboricity of a planar graph
- Pascal's Triangle and the Tower of Hanoi
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- The average eccentricity of Sierpiński graphs
- The hub number of Sierpiński-like graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Cited in
(15)- The Sierpiński product of graphs
- Structural properties of subdivided-line graphs
- Sierpiński products of \(r\)-uniform hypergraphs
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
- Metric properties of Sierpiński-like graphs
- Shortest paths in Sierpiński graphs
- \(\{P_r\}\)-free colorings of Sierpiński-like graphs.
- Feedback vertex number of Sierpiński-type graphs
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
- Generalized power domination: propagation radius and Sierpiński graphs
- The Wiener index of Sierpiński-like graphs
- A survey and classification of Sierpiński-type graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
This page was built for publication: The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444448)