The packing chromatic number of infinite product graphs
From MaRDI portal
(Redirected from Publication:1024309)
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
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 2104737 (Why is no real title available?)
- Broadcast chromatic numbers of graphs
- Complexity of the packing coloring problem for trees
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of some lattices
Cited in
(43)- Packing colorings of subcubic outerplanar graphs
- The packing chromatic number of hypercubes
- A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
- Facial packing vertex-coloring of subdivided plane graphs
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
- A survey on packing colorings
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- Packing chromatic number of certain fan and wheel related graphs
- Packing chromatic number versus chromatic and clique number
- \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
- Partial packing coloring and quasi-packing coloring of the triangular grid
- Packing coloring of Sierpiński-type graphs
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- Packing chromatic number of subdivisions of cubic graphs
- A note on \(S\)-packing colorings of lattices
- Packing chromatic number of distance graphs
- On the packing chromatic number of square and hexagonal lattice
- Packing chromatic numbers of finite super subdivisions of graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Independence number and packing coloring of generalized Mycielski graphs
- The packing chromatic number of the infinite square grid is 15
- A note on the packing chromatic number of lexicographic products
- On the packing chromatic number of subcubic outerplanar graphs
- The packing coloring problem for lobsters and partner limited graphs
- \((d, n)\)-packing colorings of infinite lattices
- Facial packing edge-coloring of plane graphs
- Notes on complexity of packing coloring
- On uniquely packable trees
- The packing coloring of distance graphs \(D(k,t)\)
- Modeling the packing coloring problem of graphs
- On packing colorings of distance graphs
- Packing chromatic number of base-3 Sierpiński graphs
- The packing chromatic number of the infinite square lattice is between 13 and 15
- Packing coloring of some undirected and oriented coronae graphs
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
- Packing chromatic number under local changes in a graph
- \(S\)-packing colorings of cubic graphs
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing coloring of hypercubes with extended Hamming codes
- Packing colouring of some classes of cubic graphs
- Packing chromatic number of cubic graphs
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)