On strongly planar not-all-equal 3SAT (Q326466): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computation of lucky number of planar graphs is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic complexity of proper labeling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3821582 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gap vertex-distinguishing edge colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On strongly planar 3SAT / rank | |||
Normal rank | |||
Latest revision as of 16:52, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On strongly planar not-all-equal 3SAT |
scientific article |
Statements
On strongly planar not-all-equal 3SAT (English)
0 references
12 October 2016
0 references
strongly planar 3SAT
0 references
strongly planar not-all-equal 3SAT
0 references
vertex-labeling by gap
0 references
