The linear \(t\)-colorings of Sierpiński-like graphs
type: Item
instance of: scholarly article
title: The linear \(t\)-colorings of Sierpiński-like graphs
zbMATH Open document ID: 1294.05078
author: Bing Xue
author: Liancui Zuo
author: Guanghui Wang
author: Guojun Li
published in: Graphs and Combinatorics
publication date: 2014-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6304684
zbMATH Keywords: partition
zbMATH Keywords: linear coloring
zbMATH Keywords: linear forest
zbMATH Keywords: Sierpiński-like graphs
MaRDI profile type: Publication
full work available at URL: s00373-013-1289-9
OpenAlex ID: W2049862157
cites work: Coloring and Counting on the Tower of Hanoi Graphs
cites work: Q5396737
cites work: Q4949857
cites work: A statistical analysis of the towers of hanoi problem
cites work: Error-correcting codes on the Towers of Hanoi graphs
cites work: Improved bounds on linear coloring of plane graphs
cites work: Q3565864
cites work: Codes and \(L(2,1)\)-labelings in Sierpiński graphs
cites work: Acyclic colorings of planar graphs
cites work: Colouring a graph frugally
cites work: Pascal's Triangle and the Tower of Hanoi
cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
cites work: The tower of Hanoi
cites work: Q4495694
cites work: On the planarity of Hanoi graphs
cites work: Coloring Hanoi and Sierpiński graphs
cites work: The average eccentricity of Sierpiński graphs
cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs
cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
cites work: Crossing numbers of Sierpiński‐like graphs
cites work: 1-perfect codes in Sierpiński graphs
cites work: The hub number of Sierpiński-like graphs
cites work: Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
cites work: New upper bounds on linear coloring of planar graphs
cites work: Q3136012
cites work: Q3073555
cites work: Q4786551
cites work: Linear coloring of planar graphs with large girth
cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata
cites work: Linear coloring of graphs embeddable in a surface of nonnegative characteristic
cites work: Linear coloring of sparse graphs
cites work: The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
cites work: Linear coloring of graphs
DOI: 10.1007/S00373-013-1289-9
description: scientific article; zbMATH DE number 6304684