19-25 June 2011
Bled, Slovenia
Europe/Ljubljana timezone
Home > Timetable > Contribution details

Packing coloring and grids

Presented by Mr. Bernard LIDICKY
Type: Oral presentation
Track: Domination, Independence and Coloring of Product Graphs


The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{k}$ where vertices in $X_{i}$ have pairwise distance greater than $i$. We improve bounds on the packing chromatic number of the square and hexagonal grids and discuss the packing chromatic number of distance graphs, which sometimes look like a grid.


Location: Bled, Slovenia
Address: Best Western Hotel Kompas Bled

Primary authors