A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
From MaRDI portal
Publication:528481
DOI10.1016/J.TCS.2017.02.005zbMath1369.68246OpenAlexW2588373402MaRDI QIDQ528481
Publication date: 12 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.005
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
This page was built for publication: A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
