The skewness of a graph is the minimum number of its edges whose deletion results in a
planar graph. We determine the minimum orders of cubic graphs with girth no more than 6 …

The skewness of a graph G is the minimum number of edges in G whose deletion results in
a planar graph. We determine the skewness (i) of the Cartesian product of G with path and …

By the skewness of a graph, we mean the minimum number of its edges whose deletion
results in a planar graph. We determine the skewness of a large family of cubic bipartite …

The skewness of a graph G, denoted by sk (G), is the minimum number of edges in G whose
removal results in a planar graph. It is an important parameter that measures how close a …

In this thesis we discuss maximum k-degenerate spanning subgraphs. A spanning subgraph
is a subgraph where only edges were deleted. In a k-degenerate graph G every subgraph of …

The skewness of a graph G is the minimum number of edges in G whose removal results in
a planar graph. It is a parameter that measures how non-planar a graph is, and it also has …

The skewness of a graph G, sk (G), is the smallest number of edges that need to be removed
from G to make it planar. The crossing number of a graph G, cr (G), is the minimum number …

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 …

Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph
K_n and F contains no boundary edge of K_n and| E (F)|\leq n-3, then K_n-F admits a …

Suppose F is a subgraph of a convex complete graph K n and F contains no boundary edge
of K n and| E (F)|≤ n− 1. We determine necessary and sufficient conditions on F such that K …