Pages that link to "Item:Q987667"

The following pages link to On the packing chromatic number of some lattices (Q987667):

Displaying 43 items.

• \(S\)-packing colorings of cubic graphs (Q294536) (← links)
• Facial packing edge-coloring of plane graphs (Q313797) (← links)
• Packing chromatic number of distance graphs (Q412353) (← links)
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
• Packing chromatic number under local changes in a graph (Q512610) (← links)
• The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575) (← links)
• The packing chromatic number of infinite product graphs (Q1024309) (← links)
• Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
• An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153) (← links)
• Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
• \((d, n)\)-packing colorings of infinite lattices (Q1701099) (← links)
• On the packing chromatic number of subcubic outerplanar graphs (Q1727741) (← links)
• Facial packing vertex-coloring of subdivided plane graphs (Q1730225) (← links)
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (Q1730261) (← links)
• On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
• A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603) (← links)
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) (← links)
• On \(S\)-packing edge-colorings of graphs with small edge weight (Q2073113) (← links)
• A survey on packing colorings (Q2194523) (← links)
• Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
• On the packing chromatic number of Moore graphs (Q2217471) (← links)
• The packing chromatic number of hypercubes (Q2352790) (← links)
• Packing coloring of some undirected and oriented coronae graphs (Q2364089) (← links)
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
• Packing chromatic number of certain fan and wheel related graphs (Q2409772) (← links)
• The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
• On packing colorings of distance graphs (Q2440126) (← links)
• Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
• A note on \(S\)-packing colorings of lattices (Q2636817) (← links)
• Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
• A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
• Polynomial instances of the packing coloring problem (Q2840736) (← links)
• On the packing chromatic number of square and hexagonal lattice (Q3191443) (← links)
• Subdivision into i-packings and S-packing chromatic number of some lattices (Q3465668) (← links)
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs (Q3503530) (← links)
• On the Choice Number of Packings (Q4906043) (← links)
• Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) (← links)
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5900073) (← links)
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5920353) (← links)
• The packing chromatic number of the infinite square grid is 15 (Q6535369) (← links)
• On uniquely packable trees (Q6608730) (← links)
• Packing chromatic number of windmill related graphs and chain silicate networks (Q6609897) (← links)
• Partial packing coloring and quasi-packing coloring of the triangular grid (Q6646429) (← links)