In this project, students will strengthen their knowledge of graph theory and
delve into geometric techniques for graph representation. Beginning with a
review of relevant literature on the notion of boxicity, participants will
apply different methodologies to establish bounds for boxicity across various
graph classes. In addition, students will be tasked with developing
heuristics and algorithms to ascertain the boxicity of select graphs from the
studied graph classes. This pivotal step often yields critical insights and
intuitions regarding the behavior of the respective graph classes.