What Is between Chordal and Weakly Chordal Graphs?-Reference-Cited by-同舟云学术

What Is between Chordal and Weakly Chordal Graphs?

Published:2008 Issue: Volume: Page:275-286
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Cohen Elad,Golumbic Martin Charles,Lipshteyn Marina,Stern Michal

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92248-3_25

Reference13 articles.

1. Berry, A., Bordat, J., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nordic Journal of Computing 7(3), 164 (Fall, 2000)

2. Buneman, P.: A characterization of rigid circuit graphs. Discrete Math. 9, 205–212 (1974)

3. Hayward, R.B., Hoàng, C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics 5, 339–349 (1989)

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

5. Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math. 23, 211–227 (1978)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2;Discrete Mathematics;2017-02

2. The vertex leafage of chordal graphs;Discrete Applied Mathematics;2014-05

3. Recognizing vertex intersection graphs of paths on bounded degree trees;Discrete Applied Mathematics;2014-01

4. Tolerance Graphs;Discrete Mathematics and Its Applications;2013-11-26

5. Towards a comprehensive theory of conflict–tolerance graphs;Discrete Applied Mathematics;2012-12