Dagstuhl 25041 — Graph Classes and Algorithmic Complexity
Eight selected questions from sections 4.1–4.9; section 4.2 remains a source pointer pending a formulation and progress check.
9 catalogue entries · 8 new problem records · 8 catalogue entries linked to problem records
Catalogue entries can be source pointers, solved items or groups of questions. They are not added to the main problem count. Status reflects the saved source, inspected 2026-09-10.
Original collection ↗Attribution and reuse
CC BY 4.0; attributed editorial adaptation of the named section authors.
9 matching entries
Clear filtersEdge-edit radius for sidestepping Hamiltonicity
Status unassessedProblem session · PDF page 11
Atoms versus nonsimplicial connected graphs
Status unassessedProblem session · PDF page 12
Subquadratic-exponent counting of graphs with small vertex cover
Status unassessedProblem session · PDF page 13
Directed cycles above the minimum indegree
Status unassessedProblem session · PDF page 13
Single-exponential algorithms parameterized by clique-width
Status unassessedProblem session · PDF page 14
Induced Disjoint Paths without an H3 subgraph
Status unassessedProblem session · PDF page 14
CMSO2 optimization in bipartite graphs with no long induced path
Status unassessedProblem session · PDF page 15
Recognizing a complete graph minus an edge as an induced minor
Status unassessedProblem session · PDF page 15
Selected source questions · PDF page 12
Formulation and relation to subsequent counterexamples need review; no new problem record imported.