Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419930 | Discrete Applied Mathematics | 2013 | 5 Pages |
Abstract
The skewness of a graph GG is the minimum number of edges in GG whose deletion results in a planar graph. We prove some results concerning the skewness for the join of two graphs. We then use these results to determine completely the skewness of complete kk-partite graphs for k=2,3,4k=2,3,4.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gek L. Chia, Kai An Sim,