Sign inSign in

Baker's theorem for planar graphs

Any planar graph's edges can be partitioned into kk sets in polynomial time such that deleting or contracting any single set yields a graph of treewidth O(k)O(k).
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Edge contraction1Edge deletion1Planar graph1Treewidth1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.