Home » News » seminar » Robert Hickingbotham gave a talk on a partition of a planar graph into connected induced subgraphs of bounded size so that all long paths intersect some part more than once at the Discrete Math Seminar

Robert Hickingbotham gave a talk on a partition of a planar graph into connected induced subgraphs of bounded size so that all long paths intersect some part more than once at the Discrete Math Seminar

On October 24, 2023, Robert Hickingbotham from Monash University gave a talk at the Discrete Math Seminar on the existence of a partition of a planar graph into connected induced subgraphs of bounded size so that all long paths intersect some part more than once and its application to k-planar graphs and powers of planar graphs. The title of his talk was “Powers of planar graphs, product structure, and blocking partitions“.