Polynomial-time algorithm for vertex k-colorability of P5-free graphs
Abstract
We give the first polynomial-time algorithm for coloring vertices of P5-free graphs with k colors. This settles an open problem and generalizes several previously known results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.