Funder
Fundação para a Ciência e a Tecnologia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference19 articles.
1. Hardness results and approximation algorithms for some problems on graphs;Aazami,2008
2. Upper bounds on the k-forcing number of a graph;Amos;Discrete Appl. Math.,2015
3. Zero forcing number of random regular graphs;Bal,2018
4. Disjunctive programming: Properties of the convex hull of feasible points;Balas;Discrete Appl. Math.,1998
5. Zero forcing sets and the minimum rank of graphs;Barioli;Linear Algebra Appl.,2008
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献