pith. sign in

12 Alexander Grigoriev and Hans L

URL:https://doi · DOI 10.1007/s00454-021-00339-8

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.CG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Min-1-Planarity is NP-Hard

cs.CG · 2026-05-14 · unverdicted · novelty 6.0 · 2 refs

Proves NP-hardness of recognizing min-1-planar graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Min-1-Planarity is NP-Hard cs.CG · 2026-05-14 · unverdicted · none · ref 7 · 2 links

    Proves NP-hardness of recognizing min-1-planar graphs.