On strongly planar not-all-equal 3SAT
From MaRDI portal
Publication:326466
DOI10.1007/s10878-015-9894-6zbMath1354.90106OpenAlexW291499614MaRDI QIDQ326466
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9894-6
Related Items (5)
On the complexity of gap-\([2\)-vertex-labellings of subcubic bipartite graphs] ⋮ Graphs without gap-vertex-labellings: families and bounds ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs
Cites Work
This page was built for publication: On strongly planar not-all-equal 3SAT