Author:
Lin Min Chih,Mizrahi Michel J.,Szwarcfiter Jayme L.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. Efficient dominating and edge dominating sets for graphs and hypergraphs;Brandstädt,2012
2. Efficient algorithms for the domination problems on interval and circular-arc graphs;Chang;SIAM J. Comput.,1998
3. Polynomial algorithms for weighted perfect domination problems on interval and circular-arc graphs;Chang;J. Inf. Sci. Eng.,1994
4. Algorithms for clique-independent sets on subclasses of circular-arc graphs;Durán;Discrete Appl. Math.,2006
5. On cliques of Helly circular-arc graphs;Lin;Electron. Notes Discrete Math.,2008
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Resolving Efficient Domination Number of Path and Comb Product of Special Graph;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023
2. On Resolving Efficient Dominating Set of Cycle and Comb Product Graph;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023
3. On resolving efficient domination number of path and comb product of special graph;Journal of Physics: Conference Series;2022-01-01
4. Modelling and solving the perfect edge domination problem;Optimization Letters;2018-10-10
5. Efficient Domination and Efficient Edge Domination: A Brief Survey;Algorithms and Discrete Applied Mathematics;2018