The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs

DOI10.1016/j.dam.2012.03.022zbMath1245.05084OpenAlexW2086582210MaRDI QIDQ444448

Bing Xue, Lian-Cui Zuo, Guo Jun Li

Publication date: 14 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.022

zbMATH Keywords

matchingSierpiński graphhamiltonicityvertex linear arboricitypath \(t\)-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Sierpiński products of r-uniform hypergraphs ⋮ The Sierpiński product of graphs ⋮ 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 ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Feedback vertex number of Sierpiński-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
• The hub number of Sierpiński-like graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The average eccentricity of Sierpiński graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• On the linear vertex-arboricity of a planar graph
• 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
• 1-perfect codes in Sierpiński graphs
• Pascal's Triangle and the Tower of Hanoi
• Crossing numbers of Sierpiński‐like graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs