On two dual classes of planar graphs

Authors:
E. S. El-Mallah;C. J. Colbourn
Affiliations:
-;-
Venue:
Discrete Mathematics
Year:
1990

Citing 0
Cited 2

The complexity of finding small triangulations of convex 3-polytopes

Journal of Algorithms - Special issue: SODA 2000
On the bend-number of planar and outerplanar graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.05

Visualization

Abstract