Pages that link to "Item:Q2009921"
From MaRDI portal
The following pages link to Modeling the packing coloring problem of graphs (Q2009921):
Displaying 19 items.
- 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)
- 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)
- \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) (← links)
- Graphs that are critical for the packing chromatic number (Q2118245) (← links)
- New results on radio \(k\)-labelings of distance graphs (Q2161267) (← links)
- A survey on packing colorings (Q2194523) (← links)
- \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
- Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs (Q2662888) (← links)
- General position sets in two families of Cartesian product graphs (Q6040049) (← links)
- On uniquely packable trees (Q6608730) (← links)
- Partial packing coloring and quasi-packing coloring of the triangular grid (Q6646429) (← links)
