Pages that link to "Item:Q326466"
From MaRDI portal
The following pages link to On strongly planar not-all-equal 3SAT (Q326466):
Displaying 5 items.
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs (Q2132413) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Graphs without gap-vertex-labellings: families and bounds (Q6064864) (← links)
