Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Bollobás, B., Cockayne, E.: Graph theoretic parameters concerning domination, independence and irredundance. J. Graph Theory 3, 241–250 (1979)
2. Brešar, B., Klavžar, S., Rall, D.F.: Dominating direct products of graphs. Discrete Math. 307(13), 1636–1642 (2007)
3. Finbow, A., Hartnell, B., Nowakowski, R.: A characterization of well-covered graphs of girth $$5$$ or greater. J. Combin. Theory Ser. B 57, 44–68 (1993)
4. Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Combin. 25, 5–10 (1988)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman & Co., New York (1979)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献