Pages that link to "Item:Q413250"
From MaRDI portal
The following pages link to Computation of lucky number of planar graphs is NP-hard (Q413250):
Displaying 4 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Topological additive numbering of directed acyclic graphs (Q477623) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
