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

DOI10.1007/S00373-013-1289-9zbMATH Open1294.05078OpenAlexW2049862157MaRDI QIDQ2014728FDOQ2014728

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

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

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)

Cites Work

• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The average eccentricity of Sierpiński graphs
• Title not available (Why is that?)
• 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
• The hub number of Sierpiński-like graphs
• Acyclic colorings of planar graphs
• Title not available (Why is that?)
• 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
• The tower of Hanoi
• Coloring and Counting on the Tower of Hanoi Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coloring Hanoi and Sierpiński graphs
• Title not available (Why is that?)
• On the planarity of Hanoi graphs
• Linear coloring of sparse graphs
• Improved bounds on linear coloring of plane graphs
• Error-correcting codes on the Towers of Hanoi graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• A statistical analysis of the towers of hanoi problem
• Title not available (Why is that?)
• Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• Title not available (Why is that?)
• New upper bounds on linear coloring of planar graphs

Cited In (11)

• Packing chromatic number of base-3 Sierpiński graphs
• Title not available (Why is that?)
• Generalized power domination: propagation radius and Sierpiński graphs
• A survey and classification of Sierpiński-type 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
• Colinear Coloring on Graphs
• 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)