Optimizing weakly triangulated graphs-Reference-Cited by-同舟云学术

Optimizing weakly triangulated graphs

Published:1989-12 Issue:1 Volume:5 Page:339-349
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Hayward Ryan,Hoàng Chính,Maffray Frédéric

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01788689.pdf

Reference8 articles.

1. Berge, C.: Färbung von Graphen deren sämtliche bzw. ungerade Kreise starr sind (Zusammenfassung). Wiss. Z. Martin-Luther-Univ. Halle-Winterberg, Math.-Natur. Reihe, 114 (1961)

2. Berge, C. Chvátal, V.:Topics on perfect graphs, Ann. Discrete Math.21, (1984)

3. Cook, S.A.: The complexity of theorem-proving procedure. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, Assoc. Comp. Mach., New York, 151–158 (1971)

4. Grötschel, M., Lovász, L. Schrijver, A.: Polynomial algorithms for perfect graphs. In: [2, pp. 325–356]

5. Hayward, R.: Weakly triangulated graphs. J. Comb. Theory (B)39, 200–208 (1985)

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

1. Nonvanishing Betti numbers of edge ideals of weakly chordal graphs;Journal of Algebraic Combinatorics;2023-06-13

2. Topological Interference Management With Adversarial Topology Perturbation: An Algorithmic Perspective;IEEE Transactions on Communications;2022-12

3. Generating Weakly Chordal Graphs from Arbitrary Graphs;Transactions on Computational Science XXXIX;2022

4. Topological Interference Management with Adversarial Perturbation;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12

5. On P5-free locally split graphs;Discussiones Mathematicae Graph Theory;2021