A Proof Technique for Skewness of Graphs
Combinatorics
2017-09-20 v1
Abstract
The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen graph P(4k, k) for odd k at least 9. This provides an answer to the conjecture raised in [3].
Keywords
Cite
@article{arxiv.1709.06280,
title = {A Proof Technique for Skewness of Graphs},
author = {Gek L. Chia and Chan L. Lee and Yan Hao Ling},
journal= {arXiv preprint arXiv:1709.06280},
year = {2017}
}
Comments
9 pages, 4 figures