Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences-Reference-Cited by-同舟云学术

Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences

Published:2012-03 Issue:4-5 Volume:160 Page:471-478
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brandstädt Andreas,Giakoumakis Vassilis,Maffray Frédéric

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference38 articles.

1. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004

2. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind;Berge;Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe,1961

3. Les problèmes de coloration en théorie des graphes;Berge;Publ. Inst. Stat. Univ. Paris,1960

4. A. Berry, A. Brandstädt, V. Giakoumakis, F. Maffray, The atomic structure of hole- and diamond-free graphs, Manuscript, 2011.

5. On algorithms for (P5, gem)-free graphs;Bodlaender;Theoret. Comput. Sci.,2005

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

1. Induced Subgraphs of Bounded Treewidth and the Container Method;SIAM Journal on Computing;2024-05-31

2. Properties and Recognition of Atom Graphs;Algorithms;2022-08-19

3. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022

4. Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph;Algorithms;2021-11-28

5. Strong cliques in diamond-free graphs;Theoretical Computer Science;2021-02