Abstract
We investigate a method of decomposing a plane near-triangulation G into a collection of induced component subgraphs which we call the W components of the graph. Each W component is essentially a plane near-triangulation with the property that the neighbourhood of every internal vertex induces a wheel. The problem of checking whether a plane near-triangulation G is chordal (or perfect) is shown to be transformable to the problem of checking whether its W components are chordal (or perfect). Using this decomposition method, we show that a plane near-triangulated graph is chordal if and only if it does not contain an internal vertex whose closed neighbourhood induces a wheel of at least five vertices. Though a simple local characterization for plane perfect near-triangulations is unlikely, we show that there exists a local characterization for perfect W components that does not contain any induced wheel of five vertices.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
West, D.B.: Introduction to Graph Theory, pp. xvi+512. Prentice Hall Inc., Upper Saddle River (1996)
Laskar, R.C., Mulder, H.M., Novick, B.: Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs. Australas. J. Combin. 52, 185–195 (2012)
Biedl, T., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G.: Tight bounds on maximal and maximum matchings. Discret. Math. 285(1), 7–15 (2004)
Kumar, P.S., Veni Madhavan, C.E.: A new class of separators and planarity of chordal graphs. In: Veni Madhavan, C.E. (ed.) FSTTCS 1989. LNCS, vol. 405, pp. 30–43. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-52048-1_30
Cahit, I., Ozel, M.: The characterization of all maximal planar graphs, Manuscript. http://www.emu.edu.tr/~ahit/prprnt.html
Benchetrit, Y., Bruhn, H.: \(h\)-perfect plane triangulations, arXiv preprint arXiv:1511.07990
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math., JSTOR, 51–229 (2006)
Acknowledgment
We would like to thank Dr. Ajit A Diwan, IIT Bombay and Dr. Jasine Babu, IIT Palakkad for their comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Salam, S.M., Chacko, D., Warrier, N.J., Krishnan, K.M., Sudeep, K.S. (2019). On Chordal and Perfect Plane Triangulations. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)