5-coloring K₃,k-minor-free graphs

DOI10.1137/1.9781611973105.71MaRDI QIDQ5741779zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Coloring algorithms for \(K_ 5\)-minor free graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• On colorability of graphs with forbidden minors along paths and circuits
• List-coloring graphs without \(K_{4,k}\)-minors
• Coloring graphs with forbidden minors

Cited in

(10)

• List-coloring graphs without \(K_{4,k}\)-minors
• The total coloring of \(K_5\)-minor-free graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• scientific article; zbMATH DE number 4144008 (Why is no real title available?)
• scientific article; zbMATH DE number 4090822 (Why is no real title available?)
• A (5,5)-Colouring of K_n with Few Colours
• On colorability of graphs with forbidden minors along paths and circuits
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• Extending planar graph algorithms to \(K_{3,3}\)-free graphs
• Coloring algorithms for \(K_ 5\)-minor free graphs

This page was built for publication: 5-coloring \(K_{3,k}\)-minor-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741779)