Pages that link to "Item:Q1024309"
From MaRDI portal
The following pages link to The packing chromatic number of infinite product graphs (Q1024309):
Displaying 14 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)
- Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- Packing chromatic number of cubic graphs (Q1686001) (← 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)
- Packing chromatic number of subdivisions of cubic graphs (Q1741592) (← links)
