Pages that link to "Item:Q1955603"
From MaRDI portal
The following pages link to A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603):
Displaying 14 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)
- On the packing chromatic number of subcubic outerplanar graphs (Q1727741) (← links)
- Modeling the packing coloring problem of graphs (Q2009921) (← links)
- A survey on packing colorings (Q2194523) (← links)
- Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
