On Chordal and Perfect Plane Triangulations

  • Sameera M. Salam
  • Daphna ChackoEmail author
  • Nandini J. Warrier
  • K. Murali Krishnan
  • K. S. Sudeep
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)


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.


Plane triangulated graphs Plane near-triangulated graphs Chordal graphs Perfect graphs 



We would like to thank Dr. Ajit A Diwan, IIT Bombay and Dr. Jasine Babu, IIT Palakkad for their comments and suggestions.


  1. 1.
    West, D.B.: Introduction to Graph Theory, pp. xvi+512. Prentice Hall Inc., Upper Saddle River (1996)Google Scholar
  2. 2.
    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)MathSciNetzbMATHGoogle Scholar
  3. 3.
    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)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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). Scholar
  5. 5.
    Cahit, I., Ozel, M.: The characterization of all maximal planar graphs, Manuscript.
  6. 6.
    Benchetrit, Y., Bruhn, H.: \(h\)-perfect plane triangulations, arXiv preprint arXiv:1511.07990
  7. 7.
    Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math., JSTOR, 51–229 (2006)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Sameera M. Salam
    • 1
  • Daphna Chacko
    • 1
    Email author
  • Nandini J. Warrier
    • 1
  • K. Murali Krishnan
    • 1
  • K. S. Sudeep
    • 1
  1. 1.Department of Computer ScienceNational Institute of Technology CalicutKozhikodeIndia

Personalised recommendations