What Is between Chordal and Weakly Chordal Graphs?

  • Elad Cohen
  • Martin Charles Golumbic
  • Marina Lipshteyn
  • Michal Stern
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5344)

Abstract

An (h,s,t)-representation of a graph G consists of a collection of subtrees {Sv| v ∈ V(G)} of a tree T, such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum degree at most s, and (iii) there is an edge between two vertices in the graph if and only if the corresponding subtrees in T have at least t vertices in common. For example, chordal graphs correspond to [ ∞ , ∞ ,1] = [3,3,1] = [3,3,2] graphs (notation of ∞ here means that no restriction is imposed).

We investigate the complete bipartite graph K2,n and prove new theorems characterizing those K2,n graphs that have an (h,s,2)-representation and those that have an (h,s,3)-representation.

We characterize [3,2,4] graphs as equivalent to the 4-flower-free [2,4,4] graphs and give a recognition algorithm for [2,3,4] graphs.

Based on these characterizations, we present new results that confirm that weakly chordal graphs, as opposed to chordal graphs, can not be characterized within the [h,s,t] framework. Furthermore, we show a hierarchy of families of graphs between chordal and weakly chordal within the [h,s,t] framework.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berry, A., Bordat, J., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nordic Journal of Computing 7(3), 164 (Fall, 2000)MathSciNetMATHGoogle Scholar
  2. 2.
    Buneman, P.: A characterization of rigid circuit graphs. Discrete Math. 9, 205–212 (1974)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Hayward, R.B., Hoàng, C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics 5, 339–349 (1989)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B, 47–56 (1974)Google Scholar
  5. 5.
    Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math. 23, 211–227 (1978)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B 38, 8–22 (1985)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Golumbic, M., Lipshteyn, M., Stern, M.: Finding intersection models of weakly chordal graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 241–255. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Golumbic, M., Lipshteyn, M., Stern, M.: Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discrete Applied Mathematics (to appear)Google Scholar
  9. 9.
    Golumbic, M., Trenk, A.: Tolerance Graphs, Ch. 11. Cambridge Univ. Press, Cambridge (2004)CrossRefMATHGoogle Scholar
  10. 10.
    McMorris, F.R., Scheinerman, E.: Connectivity threshold for random chordal graphs. Graphs and Combin. 7, 177–181 (1991)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Jamison, R.E., Mulder, H.M.: Constant tolerance intersection graphs of subtrees of a tree. Discrete Mathematics 290, 27–46 (2005)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Jamison, R.E., Mulder, H.M.: Tolerance intersection graphs on binary trees with constant tolerance 3. Discrete Mathematics 215, 115–131 (2000)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Walter, J.R.: Representations of rigid cycle graphs, Ph.D. Thesis, Wayne State Univ. (1972)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Elad Cohen
    • 1
  • Martin Charles Golumbic
    • 1
  • Marina Lipshteyn
    • 1
  • Michal Stern
    • 1
    • 2
  1. 1.Caesarea Rothschild InstituteUniversity of HaifaIsrael
  2. 2.The Academic College of Tel-Aviv - YaffoIsrael

Personalised recommendations