Bodini , On the minimum size of a contraction-universal tree , in 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol

· 2002 · Lecture notes in computer science · DOI 10.1007/3-540-36379-3_3

1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.

1 Pith paper citing it

1 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2025-06-13 · conditional · novelty 7.0

The minimum isometric-universal graph for two forests can be computed in polynomial time, while the problem for three forests is NP-complete.

Showing 1 of 1 citing paper.

Isometric-Universal Graphs for Trees cs.DS · 2025-06-13 · conditional · none · ref 6
The minimum isometric-universal graph for two forests can be computed in polynomial time, while the problem for three forests is NP-complete.