Skip to main content
Log in

Properties of π-skew Graphs with Applications

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

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 graph is to planarity, and it is complementary, and computationally equivalent, to the Maximum Planar Subgraph Problem. For any connected graph G on p vertices and q edges with girth g, one can easily verify that sk(G) ≥ π(G), where \(\pi(G)=\lceil q-\frac{g}{g-2}(p-2)\rceil\), and the graph G is said to be π-skew if equality holds. The concept of π-skew was first proposed by G. L. Chia and C. L. Lee. The π-skew graphs with girth 3 are precisely the graphs that contain a triangulation as a spanning subgraph. The purpose of this paper is to explore the properties of π-skew graphs. Some families of π-skew graphs are obtained by applying these properties, including join of two graphs, complete multipartite graphs and Cartesian product of two graphs. We also discuss the threshold for the existence of a spanning triangulation. Among other results some sufficient conditions regarding the regularity and size of a graph, which ensure a spanning triangulation, are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allen, P., Skokan, J., Wurfl, A.: Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 203, #P1 (2013)

    Article  MathSciNet  Google Scholar 

  2. Bondy, J. A., Murty, U. S. R.: Graph Theory, Grad. Texts in Math., Vol. 244, Springer-Verlag, New York, 2008

    Google Scholar 

  3. Chia, G. L., Sim, K. A.: On the skewness of the join of graphs. Discrete Appl. Math., 161, 2405–2408 (2013)

    Article  MathSciNet  Google Scholar 

  4. Chia, G. L., Lee, C. L.: Skewness and crossing numbers of graphs. Bull. Inst. Combin. Appl., 55, 17–32 (2009)

    MathSciNet  MATH  Google Scholar 

  5. Chia, G. L., Lee, C. L.: Skewness of some generalized Petersen graphs and related graphs. Front. Math. China, 7, 427–436 (2012)

    Article  MathSciNet  Google Scholar 

  6. Cimikowski, R. J.: Graph planarization and skewness. Congr. Numer., 88, 21–32 (1992)

    MathSciNet  MATH  Google Scholar 

  7. Dirac, G. A.: Some theorems on abstract graphs. Proc. London Math. Soc., 2, 69–81 (1952)

    Article  MathSciNet  Google Scholar 

  8. Farr, G., Eades, P.: Skewness of graphs with small cutsets. Graphs and Combinatorics, 19, 177–194 (2003)

    Article  MathSciNet  Google Scholar 

  9. Guy, R. K.: The slimming number and genus of graphs. Canad. Math. Bull., 15, 195–200 (1972)

    Article  MathSciNet  Google Scholar 

  10. Guy, R. K., Hill, A.: The crossing number of the complement of a circuit. Discrete Math., 5(4), 335–344 (1973)

    Article  MathSciNet  Google Scholar 

  11. Harary, F., Hayes, J. P., Wu, H. J.: A survey of the theory of hypercube graphs. Comput. Math, Appl., 15, 277–289 (1988)

    Article  MathSciNet  Google Scholar 

  12. Kühn, D., Osthus, D., Taraz, A.: Large planar subgraphs in dense graphs. J. Combinatorial Theory Series B, 95, 263–282 (2005)

    Article  MathSciNet  Google Scholar 

  13. Kühn, D., Osthus, D., Szemerédi, E.: Spanning triangulations in graphs. J. Graph Theory, 49, 205–233 (2005)

    Article  MathSciNet  Google Scholar 

  14. Kotzig, A.: On certain decompositions of a graph. Matematicko-fyzikány Časopis, 5(3), 144–151 (1955)

    MathSciNet  Google Scholar 

  15. Leighton, F. T.: New lower bound techniques for VLSI. In: Proc. of the 22nd Annual Symposium on Foundations of Computer Science, Volume 42, 1–12. IEEE Computer Society, 1981

  16. Liebers, A.: Planarizing graphs—a survey and annotated bibliography. J. Graph Algorithms Appl., 5, 1–74 (2001)

    Article  MathSciNet  Google Scholar 

  17. Liu, P. C., Geldmacher, R. C.: On the deletion of nonplanar edges of a graph. Congr. Numer., 24, 727–738 (1979)

    MathSciNet  MATH  Google Scholar 

  18. Mendonça, C. F. X., Schaffer, K., Xavier, E. F., et al.: The splitting number and skewness of CnCm. Ars Combinatoria, 63, 193–205 (2002)

    MathSciNet  MATH  Google Scholar 

  19. Mendoncça, C. F. X.: A layout system for information system diagrams. Ph.D. thesis, University of Newcastle, Australia, March 1994

  20. Ringel, G.: Non-existence of graph embeddings, In: Theory and Applications of Graphs (Y. Alavi and D.R. Lick, eds.), Springer-Verlag, Berlin, 1978, 455–475

    Google Scholar 

  21. Yannakakis, M.: Edge-deletion problems. SIAM J. Comput., 10, 297–309 (1981)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research was conducted while the first author was visiting the National Institute of Education, Nanyang Technological University, Singapore. The first author is very grateful to all staff in NIE/NTU for their help during his visit. The authors would also like to thank the anonymous referees for their insightful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhang Dong Ouyang.

Additional information

Supported by the National Natural Science Foundation of China (Grant No. 11301169), Hu’nan Provincial Natural Science Foundation of China (Grant No. 2017JJ2055) and Scientific Research Fund of Hu’nan Provincial Education Department (Grant No. 18A432)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ouyang, Z.D., Dong, F.M., Zhang, R.X. et al. Properties of π-skew Graphs with Applications. Acta. Math. Sin.-English Ser. 37, 641–656 (2021). https://doi.org/10.1007/s10114-020-9378-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-020-9378-1

Keywords

MR(2010) Subject Classification

Navigation