| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652506 | Electronic Notes in Discrete Mathematics | 2008 | 4 Pages |
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 edges.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
