The linear t-colorings of Sierpiński-like graphs

DOI10.1007/S00373-013-1289-9MaRDI QIDQ2014728zbMATH OpenOpenAlexFDO

Authors Bing Xue, Liancui Zuo, Guanghui Wang, Guojun 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

partitionlinear coloringlinear forestSierpiński-like graphs

Mathematics Subject Classification ID

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

Recommendations

• The hamiltonicity and path t-coloring of Sierpiński-like graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• \(\{P_r\}\)-free colorings of Sierpiński-like graphs.
• Linear coloring of graphs
• Packing coloring of generalized Sierpinski graphs

Cites work

• scientific article; zbMATH DE number 416858 (Why is no real title available?)
• scientific article; zbMATH DE number 1488860 (Why is no real title available?)
• scientific article; zbMATH DE number 1846807 (Why is no real title available?)
• scientific article; zbMATH DE number 1439478 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• A statistical analysis of the towers of hanoi problem
• Acyclic colorings of planar graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Coloring Hanoi and Sierpiński graphs
• Coloring and counting on the tower of Hanoi graphs
• Colouring a graph frugally
• Covering codes in Sierpiński graphs
• Crossing numbers of Sierpiński‐like graphs
• Equitable L(2,1)-labelings of Sierpiński graphs
• Error-correcting codes on the Towers of Hanoi graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Improved bounds on linear coloring of plane graphs
• Linear coloring of graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of planar graphs with large girth
• Linear coloring of sparse graphs
• 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
• New upper bounds on linear coloring of planar graphs
• On some metric properties of the Sierpiński graphs S(n,k)
• On the planarity of Hanoi graphs
• 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 hamiltonicity and path t-coloring of Sierpiński-like graphs
• The hub number of Sierpiński-like graphs
• The tower of Hanoi
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Cited in

(12)

• Colinear Coloring on Graphs
• Packing chromatic number of base-3 Sierpiński graphs
• scientific article; zbMATH DE number 29786 (Why is no real title available?)
• \(\{P_r\}\)-free colorings of Sierpiński-like graphs.
• A survey and classification of Sierpiński-type graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Linear colorings of subcubic graphs
• Structural properties of subdivided-line graphs
• Linear colorings of simplicial complexes and collapsing
• Coloring the square of Sierpiński graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014728)