The linear \(t\)-colorings of Sierpiński-like graphs

DOI10.1007/s00373-013-1289-9zbMath1294.05078OpenAlexW2049862157MaRDI QIDQ2014728

Bing Xue, Guang-Hui Wang, Lian-Cui Zuo, Guo Jun Li

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1289-9

zbMATH Keywords

partitionSierpiński-like graphslinear coloringlinear forest

Mathematics Subject Classification ID

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

Related Items (6)

Packing chromatic number of base-3 Sierpiński graphs ⋮ Coloring the square of Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• Linear coloring of sparse graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• Improved bounds on linear coloring of plane graphs
• The hub number of Sierpiński-like graphs
• On the planarity of Hanoi graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of planar graphs with large girth
• Colouring a graph frugally
• Linear coloring of graphs
• New upper bounds on linear coloring of planar graphs
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Error-correcting codes on the Towers of Hanoi graphs
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Coloring and Counting on the Tower of Hanoi 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
• 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
• Acyclic colorings of planar graphs

This page was built for publication: The linear \(t\)-colorings of Sierpiński-like graphs