Packing coloring of Sierpiński-type graphs

DOI10.1007/s00010-018-0561-8zbMath1400.05079arXiv1711.03856OpenAlexW2767574922MaRDI QIDQ1621491

Boštjan Brešar, Jasmina Ferme

Publication date: 9 November 2018

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

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

zbMATH Keywords

packing chromatic numberSierpiński graphSierpiński triangle

Mathematics Subject Classification ID

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

Related Items (8)

Independence number and packing coloring of generalized Mycielski graphs ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ A survey on packing colorings ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Packing colouring of some classes of cubic graphs ⋮ Graphs that are critical for the packing chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• A survey and classification of Sierpiński-type graphs
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Packing chromatic number of cubic graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• Modeling the packing coloring problem of graphs
• The packing chromatic number of hypercubes
• On generalized Sierpiński graphs
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• The packing coloring problem for lobsters and partner limited graphs
• Packing chromatic number of base-3 Sierpiński graphs
• The S-packing chromatic number of a graph
• On the packing chromatic number of square and hexagonal lattice
• Subdivision into i-packings and S-packing chromatic number of some lattices
• Packing Coloring of Undirected and Oriented Generalized Theta Graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Packing coloring of Sierpiński-type graphs