On vertex coloring without monochromatic triangles

DOI10.1007/978-3-319-90530-3_19zbMath1484.68165arXiv1710.07132OpenAlexW2963496693MaRDI QIDQ1625170

Michał Karpiński, Krzysztof Piecuch

Publication date: 28 November 2018

Full work available at URL: https://arxiv.org/abs/1710.07132

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy ⋮ On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}

This page was built for publication: On vertex coloring without monochromatic triangles