On the skewness of graphs / Sim Kai An
Let G be a graph. The crossing number of G, denoted as cr(G), is the minimum number of crossings of its edges among all drawings of G in the plane. The skewness of a graph G, denoted as sk(G), is the minimum number of edges in G whose deletion results in a planar graph. In Chapter 1 of this thesis...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://studentsrepo.um.edu.my/4826/1/mscthesis.pdf http://studentsrepo.um.edu.my/4826/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Malaya |