Boundary classes of graphs for the dominating set problem-Reference-Cited by-同舟云学术

Boundary classes of graphs for the dominating set problem

Published:2004-08 Issue:1-3 Volume:285 Page:1-6
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Alekseev Vladimir E,Korobitsyn Dmitry V,Lozin Vadim V

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference9 articles.

1. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, 1983, pp. 3–13 (in Russian).

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

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

4. An upper bound on the number of cliques in a graph;Farber;Networks,1993

5. Split graphs;Foldes;Congr. Numer.,1977

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

1. Critical properties of bipartite permutation graphs;Journal of Graph Theory;2023-08

2. On a Countable Family of Boundary Graph Classes for the Dominating Set Problem;Journal of Applied and Industrial Mathematics;2023-03

3. Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems;SIAM Journal on Discrete Mathematics;2022-11-14

4. FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems;Computational Aspects and Applications in Large-Scale Networks;2018

5. Boundary classes for graph problems involving non-local properties;Theoretical Computer Science;2017-09