Skip to main content

Volume 18 Supplement 2

GraphCliques

Determining what sets of trees can be the clique trees of a chordal graph

Abstract

Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is studied: given a family of trees, all having the same vertex set V, determine whether there exists a chordal graph whose set of clique trees equals . For that purpose, we undertake a study of the structural properties, some already known and some new, of the clique trees of a chordal graph and the characteristics of the sets that induce subtrees of every clique tree. Some necessary and sufficient conditions and examples of how they can be applied are found, eventually establishing that a positive or negative answer to the problem can be obtained in polynomial time. If affirmative, a graph whose set of clique trees equals is also obtained. Finally, all the chordal graphs with set of clique trees equal to are characterized.

References

  1. 1.

    De Caria P, Gutierrez M (2011) Comparing trees characteristic to chordal and dually chordal graphs. Electron Notes Discrete Math 37:33–38

    Article  Google Scholar 

  2. 2.

    Dirac GA (1961) On rigid circuit graphs. Abh Math Semin Univ Hamb 25:71–76

    MATH  MathSciNet  Article  Google Scholar 

  3. 3.

    Galinier P, Habib M, Paul C (1995) Chordal graphs and their clique graphs. Lect Notes Comput Sci 1017:358–371

    MathSciNet  Article  Google Scholar 

  4. 4.

    Gavril F (1974) The intersection graphs of subtrees in trees are exactly the chordal graphs. J Comb Theory, Ser B 116:47–56

    MathSciNet  Article  Google Scholar 

  5. 5.

    Gavril F (1987) Generating the maximum weight spanning trees of a weighted graph. J Algorithms 8:592–597

    MATH  MathSciNet  Article  Google Scholar 

  6. 6.

    Golumbic MC (2004) Algorithmic graph theory and perfect graphs, 2nd edn. Annals of discrete mathematics, vol 57. Elsevier, Amsterdam, p 10

    MATH  Google Scholar 

  7. 7.

    Habib H, Stacho J (2011) Reduced clique graphs of chordal graphs. Accepted to Eur J Combin

  8. 8.

    Kruskal JB (1956) On the shortest spanning tree of a graph and the traveling salesman problem. Proc Am Math Soc 7:48–50

    MATH  MathSciNet  Article  Google Scholar 

  9. 9.

    Bernstein PA, Goodman N (1981) Power of natural semijoins. SIAM J Comput 10:751–771

    MATH  MathSciNet  Article  Google Scholar 

  10. 10.

    Shibata Y (1988) On the tree representation of chordal graphs. J Graph Theory 12:421–428

    MATH  MathSciNet  Article  Google Scholar 

  11. 11.

    Sreenivasa Kumara P, Veni Madhavanb CE (2002) Clique tree generalization and new subclasses of chordal graphs. Discrete Appl Math 117:109–131

    MATH  MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Marisa Gutierrez.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

De Caria, P., Gutierrez, M. Determining what sets of trees can be the clique trees of a chordal graph. J Braz Comput Soc 18, 121–128 (2012). https://doi.org/10.1007/s13173-011-0048-0

Download citation

Keywords

  • Chordal graph
  • Clique tree
  • Minimal separator
  • Clique