Polynomial algorithm for finding the largest independent sets in graphs without forks-Reference-Cited by-同舟云学术

Polynomial algorithm for finding the largest independent sets in graphs without forks

Published:2004-01 Issue:1-3 Volume:135 Page:3-16
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Alekseev V.E.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 articles.

1. V.E. Alekseev, On influence of the local restrictions to the complexity of finding the independence number of a graph, Kombinatorno-algebraicheskie metody v prikladnoy matematike, Gorki State University, Gorki, 1982, pp. 3–13 (in Russian).

2. V.E. Alekseev, On the number of deadlock independent sets in graphs from hereditary classes, Kombinatorno-algebraicheskie metody v diskretnoy optimizacii, N. Novgorod, Nizhniy Novgorod State University, 1991, pp. 5–8 (in Russian).

3. On the complexity of some problems for hereditary classes of graphs;Alekseev;Diskret. Mat.,1992

4. Stability number of bull- and chair-free graphs;De Simone;Discrete Appl. Math.,1993

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Few induced disjoint paths for H-free graphs;Theoretical Computer Science;2023-01

2. Parameterized Inapproximability of Independent Set in H-Free Graphs;Algorithmica;2022-10-20

3. Partitioning H-free graphs of bounded diameter;Theoretical Computer Science;2022-09

4. New Results on Independent Sets in Extensions of $$2K_2$$-free Graphs;Graphs and Combinatorics;2022-07-29

5. Coloring Graph Classes with no Induced Fork via Perfect Divisibility;The Electronic Journal of Combinatorics;2022-07-15