Author:
Cockayne E.J.,Hedetniemi S.T.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. The number of labeled k-dimensional trees;Beineke;J. Combin. Theory,1969
2. Graphs and Hypergraphs;Berge,1973
3. A general class of invulnerable graphs;Beeich;Networks,1972
4. Uniquely colorable planar graphs;Chartrand;J. Combin. Theory,1969
5. Independence graphs;Cockayne;Proc. 5th S.E. Conference on Combinatorics, Graphs and Computing,1974
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Fall-Colorable Graphs;Mathematics;2024-04-07
2. Disjoint maximal independent sets in graphs and hypergraphs;Discussiones Mathematicae Graph Theory;2023
3. Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles;International Journal of Computational and Applied Mathematics & Computer Science;2022-09-02
4. Independent domination in directed graphs;COMMUN COMB OPTIM;2021
5. Independent domination in signed graphs;Discrete Mathematics, Algorithms and Applications;2020-12-22