The packing chromatic number of hypercubes

DOI10.1016/J.DAM.2015.04.006MaRDI QIDQ2352790zbMATH OpenOpenAlexFDO

Authors P. Torres, Mario Valencia-Pabon

Publication date 6 July 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.04.006

zbMATH Keywords

hypercube graphspacking chromatic numberupper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• On the packing chromatic number of square and hexagonal lattice
• Packing colouring of some classes of cubic graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On packing colorings of distance graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

Cites work

• A lower bound for the packing chromatic number of the Cartesian product of cycles
• A note on \(S\)-packing colorings of lattices
• A table of upper bounds for binary codes
• Broadcast chromatic numbers of graphs
• Complexity of the packing coloring problem for trees
• scientific article; zbMATH DE number 5901714 (Why is no real title available?)
• On packing colorings of distance graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of some lattices
• On the packing chromatic number of square and hexagonal lattice
• The S-packing chromatic number of a graph
• The packing chromatic number of infinite product graphs
• The packing coloring of distance graphs \(D(k,t)\)
• The packing coloring problem for (q,q-4) graphs
• The packing coloring problem for lobsters and partner limited graphs

Cited in

(21)

• Packing coloring of Sierpiński-type graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number versus chromatic and clique number
• Packing chromatic number of subdivisions of cubic graphs
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• Graphs that are critical for the packing chromatic number
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• A survey on packing colorings
• Packing colorings of subcubic outerplanar graphs
• On the packing chromatic number of Moore graphs
• Packing coloring of some undirected and oriented coronae graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Independence number and packing coloring of generalized Mycielski graphs
• The \(b\)-chromatic number of powers of hypercube
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• Packings in bipartite prisms and hypercubes
• Packing chromatic number of windmill related graphs and chain silicate networks
• Packing coloring of hypercubes with extended Hamming codes
• On a heterochromatic number for hypercubes
• On the packing chromatic number of some lattices

This page was built for publication: The packing chromatic number of hypercubes

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