Modeling the packing coloring problem of graphs

DOI10.1016/J.APM.2014.11.060MaRDI QIDQ2009921zbMATH OpenOpenAlexFDO

Authors Zehui Shao, Aleksander Vesel

Publication date 3 December 2019

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2014.11.060

zbMATH Keywords

Cartesian productfrequency assignmentinteger linear programmingpacking chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Notes on complexity of packing coloring
• A note on packing chromatic number of the square lattice
• Frequency planning and ramifications of coloring
• Chromatic scheduling and frequency assignment
• scientific article; zbMATH DE number 1953160

Cites work

• A lower bound for the packing chromatic number of the Cartesian product of cycles
• A note on packing chromatic number of the square lattice
• Broadcast chromatic numbers of graphs
• Complexity of the packing coloring problem for trees
• Exact Algorithms for L(2,1)-Labeling of Graphs
• Handbook of product graphs
• Models and solution techniques for frequency assignment problems
• On packing colorings of distance graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of square and hexagonal lattice
• Packing chromatic number of distance graphs
• The packing chromatic number of infinite product graphs
• The packing coloring of distance graphs \(D(k,t)\)

Cited in

(22)

• 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
• (d, n)-packing colorings of infinite lattices
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
• Graphs that are critical for the packing chromatic number
• New results on radio \(k\)-labelings of distance graphs
• A survey on packing colorings
• \(S\)-packing chromatic vertex-critical graphs
• Packing colorings of subcubic outerplanar graphs
• The packing coloring problem for lobsters and partner limited graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Independence number and packing coloring of generalized Mycielski graphs
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
• Broadcast chromatic numbers of graphs
• Graph coloring models and metaheuristics for packing applications
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• The packing chromatic number of the infinite square lattice is between 13 and 15
• General position sets in two families of Cartesian product graphs
• On uniquely packable trees
• Partial packing coloring and quasi-packing coloring of the triangular grid

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Modeling the packing coloring problem of graphs

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