On March 3, 2020, Eun-Kyung Cho (조은경) from Hankuk University of Foreign Studies presented a talk on the existence of a decomposition of a planar graph into two edge-disjoint subgraphs, one of which is d-degenerate and the other has maximum degree at most h at the discrete math seminar. The title of her talk was “Decomposition of a planar graph into a d-degenerate graph and a graph with maximum degree at most h“. She will visit the IBS discrete math group until March 6.
Eun-Kyung Cho (조은경) gave a talk on the problem of decomposing a graph into a d-degenerate graph and a graph of bounded maximum degree at the Discrete Math Seminar
