On the generic complexity of graph 3-coloring problems

MaRDI QIDQ6889544zbMATH OpenFDO

Authors D. P. Ruzanova, Alexander Rybalov

Publication date 4 December 2025

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

generic complexity3-coloring of graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On the generic complexity of graph 3-coloring problems

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