On strongly planar not-all-equal 3SAT

DOI10.1007/s10878-015-9894-6zbMath1354.90106OpenAlexW291499614MaRDI QIDQ326466

Ali Dehghan

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

zbMATH Keywords

strongly planar 3SATstrongly planar not-all-equal 3SATvertex-labeling by gap

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

• Unnamed Item
• On strongly planar 3SAT
• Algorithmic complexity of proper labeling problems
• Computation of lucky number of planar graphs is NP-hard
• Gap vertex-distinguishing edge colorings of graphs

This page was built for publication: On strongly planar not-all-equal 3SAT