Pith. sign in

Title resolution pending

· 2016 · DOI 10.1007/978-3-662-49192-8

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

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

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CG 1

years

2019 1

verdicts

REJECT 1

representative citing papers

Representing Graphs and Hypergraphs by Touching Polygons in 3D

cs.CG · 2019-08-22 · reject · novelty 7.0

All graphs with minimum degree at least three admit corner-touching convex polygon representations in 3D, with polynomial-grid algorithms for bipartite, cubic, and 1-planar cubic graphs and impossibility results for Steiner quadruple systems.

citing papers explorer

Showing 1 of 1 citing paper.

  • Representing Graphs and Hypergraphs by Touching Polygons in 3D cs.CG · 2019-08-22 · reject · none · ref 3

    All graphs with minimum degree at least three admit corner-touching convex polygon representations in 3D, with polynomial-grid algorithms for bipartite, cubic, and 1-planar cubic graphs and impossibility results for Steiner quadruple systems.