On strongly planar not-all-equal 3SAT

DOI10.1007/S10878-015-9894-6zbMATH Open1354.90106OpenAlexW291499614MaRDI QIDQ326466FDOQ326466

Authors: A. 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

Recommendations

• On strongly planar 3SAT
• scientific article; zbMATH DE number 4094812
• scientific article; zbMATH DE number 152108
• The Complexity of Planar Counting Problems
• On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• On strongly planar 3SAT
• Title not available (Why is that?)
• Algorithmic complexity of proper labeling problems
• Computation of lucky number of planar graphs is NP-hard
• Gap vertex-distinguishing edge colorings of graphs

Cited In (10)

• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
• Planar 3-SAT with a clause/variable cycle
• On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs
• Theory and Applications of Satisfiability Testing
• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Graphs without gap-vertex-labellings: families and bounds
• Title not available (Why is that?)
• On strongly planar 3SAT
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}

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

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