Agnes Totschnig

activity

20242026

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Almost perfect graph classes

Cicely Henderson, Hidde Koerts, Taite LaGrange +4

A graph $G$ is perfect if $ω (H) = χ (H)$ for each induced subgraph $H$ of $G$ . In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…

math.CO2025

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

Sergey Norin, Agnes Totschnig

Let $K_{7}^{\lor}$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that ever…

Almost perfect graph classes

Every graph with no K7∨​-minor is 6-colorable

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable