Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Borodin, O.V., Dmitriev, L.G.: Characterization of chromatically rigid polynomials (in Russian). Sibirsk. Mat. Zh. 32, 22–27 (1991)
2. Chao, C.-Y., Li, N.-Z., Xu, S.-J.: On q-trees. J. Graph Theory 10, 129–136 (1986)
3. Dirac, G.A.: A theorem of R.L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. (3)7, 161–195 (1957)
4. Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71–76 (1961)
5. Dmitriev, I.G.: Characterization of the class of k-trees (in Russian). Metody Diskret. Analiz. 28, 9–18 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献