The packing chromatic number of infinite product graphs

DOI10.1016/J.EJC.2008.09.014zbMATH Open1207.05165OpenAlexW2119765243MaRDI QIDQ1024309FDOQ1024309

Sandi Klavžar, Jiří Fiala, Bernard Lidický

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.014

Recommendations

• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of square and hexagonal lattice
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
• On the packing chromatic number of some lattices

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• Title not available (Why is that?)

Cited In (40)

• Packing chromatic number of base-3 Sierpiński graphs
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
• Facial packing vertex-coloring of subdivided plane graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• Modeling the packing coloring problem of graphs
• Packing colouring of some classes of cubic graphs
• Notes on complexity of packing coloring
• The packing coloring problem for lobsters and partner limited graphs
• \(S\)-packing colorings of cubic graphs
• On uniquely packable trees
• Packing chromatic number versus chromatic and clique number
• \((d, n)\)-packing colorings of infinite lattices
• A survey on packing colorings
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Facial packing edge-coloring of plane graphs
• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• Packing chromatic number of distance graphs
• Independence number and packing coloring of generalized Mycielski graphs
• A note on the packing chromatic number of lexicographic products
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• Packing coloring of hypercubes with extended Hamming codes
• Packing coloring of Sierpiński-type graphs
• On packing colorings of distance graphs
• Packing chromatic number of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
• Partial packing coloring and quasi-packing coloring of the triangular grid
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colorings of subcubic outerplanar graphs
• On the packing chromatic number of subcubic outerplanar graphs
• A note on \(S\)-packing colorings of lattices
• 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 grid is 15
• The packing coloring of distance graphs \(D(k,t)\)
• Packing coloring of some undirected and oriented coronae graphs
• Packing chromatic number of certain fan and wheel related graphs
• Packing chromatic numbers of finite super subdivisions of graphs
• The packing chromatic number of hypercubes

This page was built for publication: The packing chromatic number of infinite product graphs

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