Explain Daniel Král's work on graph minors.
Graph minors represent a core concept in my research. A graph H is a minor of a graph G if H can be obtained from G by deleting edges, deleting vertices, and contracting edges. My work often explores how the presence or absence of certain minors in a graph dictates its structural properties and algorithmic behavior. This has led to advancements in understanding graph classes and developing algorithms that are efficient for graphs belonging to these classes, as defined by minor-closed properties.
Ask Daniel Kráľ the follow-up →