5-coloring K3,k-minor-free graphs

DOI10.1137/1.9781611973105.71zbMath1423.05174OpenAlexW4245815037MaRDI QIDQ5741779

Ken-ichi Kawarabayashi

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.71

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: 5-coloring K_3,k-minor-free graphs