Pages that link to "Item:Q5900073"
From MaRDI portal
The following pages link to On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5900073):
Displaying 16 items.
- The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575) (← links)
- On the packing chromatic number of some lattices (Q987667) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- Packing chromatic number of subdivisions of cubic graphs (Q1741592) (← links)
- A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603) (← links)
- Graphs that are critical for the packing chromatic number (Q2118245) (← links)
- On the packing chromatic number of Moore graphs (Q2217471) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- Packing chromatic number of certain fan and wheel related graphs (Q2409772) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← 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 packing coloring of helm related graphs (Q5036739) (← links)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5920353) (← links)