On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs

DOI10.1007/s00010-020-00747-wzbMath1461.05087arXiv1909.08285OpenAlexW3082064622MaRDI QIDQ2662888

Aleksander Vesel, Fei Deng, Zehui Shao

Publication date: 15 April 2021

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.08285

zbMATH Keywords

Sierpiński graphpacking coloring\(H\)-graph\(S\)-packing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)

Cites Work

• Unnamed Item
• Packing chromatic number under local changes in a graph
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Packing coloring of Sierpiński-type graphs
• Packing chromatic number of cubic graphs
• \((d, n)\)-packing colorings of infinite lattices
• Modeling the packing coloring problem of graphs
• A survey on packing colorings
• Packing chromatic number of base-3 Sierpiński graphs
• The S-packing chromatic number of a graph
• Subdivision into i-packings and S-packing chromatic number of some lattices
• Packing colouring of some classes of cubic graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• Packing coloring of generalized Sierpinski graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs