A proof technique for skewness of graphs.

MaRDI QIDQ5206384zbMATH OpenFDO

Authors Yan Hao Ling, Gek L. Chia, Chan L. Lee

Publication date 18 December 2019

Full work available at URL https://arxiv.org/abs/1709.06280

zbMATH Keywords

generalized Petersen graphgraph skewnessplanar graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

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].

Recommendations

• Skewness of generalized Petersen graphs and related graphs
• Combinatorial Geometry and Graph Theory
• Skewness and crossing numbers of graphs
• A note on the Skewness of a graph
• On the skewness of the join of graphs

Cited in

(10)

• Skewness of generalized Petersen graphs and related graphs
• Properties of \(\pi\)-skew graphs with applications
• On the skewness of Cartesian products with trees
• On the skewness of the join of graphs
• A note on the Skewness of a graph
• Skewness and crossing numbers of graphs
• Skewness, minimum degree and chromatic number
• Combinatorial Geometry and Graph Theory
• On the skewness of products of graphs
• On the skewness of the generalized Heawood graphs

This page was built for publication: A proof technique for skewness of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206384)