Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.
Polynomial-time data reduction for the subset interconnection design problem.SIAM Journal on Discrete Mathematics, 29(1):1–25, 2015
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Supports for graphs of bounded genus
Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.