Title of article
Connectivity augmentation in plane straight line graphs
Author/Authors
Tَth، نويسنده , , Csaba D.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
4
From page
49
To page
52
Abstract
It is shown that every plane straight line tree with n vertices can be augmented to a 2-edge connected plane straight line graph by adding at most ⌊ n / 2 ⌋ edges, and every connected plane straight line graph with n vertices can be augmented to a 2-edge connected plane straight line graph by adding at most 2 3 n + O ( 1 ) edges.
Keywords
plane straight line graphs , connectivity augmentation , geodesic hulls
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454897
Link To Document