On strongly planar not-all-equal 3SAT
type: Item
instance of: scholarly article
title: On strongly planar not-all-equal 3SAT
zbMATH Open document ID: 1354.90106
author: A. Dehghan
published in: Journal of Combinatorial Optimization
publication date: 2016-10-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6637628
zbMATH Keywords: strongly planar 3SAT
zbMATH Keywords: strongly planar not-all-equal 3SAT
zbMATH Keywords: vertex-labeling by gap
MaRDI profile type: Publication
full work available at URL: s10878-015-9894-6
OpenAlex ID: W291499614
cites work: Computation of lucky number of planar graphs is NP-hard
cites work: Algorithmic complexity of proper labeling problems
cites work: Q3821582
cites work: Gap vertex-distinguishing edge colorings of graphs
cites work: On strongly planar 3SAT
DOI: 10.1007/S10878-015-9894-6
description: scientific article; zbMATH DE number 6637628