Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. On the domatic number of interval graphs;Bertossi;Inform. Process. Lett.,1988
2. Dominating sets and domatic number of circular arc graphs;Bonucelli;Discrete Appl. Math.,1985
3. Domination of undirected graphs — a survey;Cockayne,1978
4. Optimal domination in graphs;Cockayne;IEEE Trans. Circuits Systems,1975
5. Towards a theory of domination in graphs;Cockayne;Networks,1977
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic study on 2-transitivity of graphs;Discrete Applied Mathematics;2024-12
2. Strong transitivity of a graph;Discrete Mathematics, Algorithms and Applications;2024-08-31
3. Independent coalition in graphs: existence and characterization;Ars Mathematica Contemporanea;2024-08-23
4. Algorithmic study of d2-transitivity of graphs;Discrete Mathematics Letters;2024-04-04
5. Transitivity on Subclasses of Chordal Graphs;Algorithms and Discrete Applied Mathematics;2023