20 citations · 86 across the 29 of their papers we have counts for
Showing 2025 · math.COShow all
2 papers · 2 filters
math.CO2025
Every graph with no -minor is -colorable
Sergey Norin, Agnes Totschnig
Let 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…
math.CO2025
3-Colouring Planar Graphs
Vida Dujmović, Pat Morin, Sergey Norin +1
We show that every -vertex planar graph is 3-colourable with monochromatic components of size . The best previous bound was due to Linial, Matoušek, She…