Author:
Chao Chong-Yun,Whitehead Earl Glen
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. D. Geller and B. Manvel, "Reconstruction of Cacti," Canadian J. Math. 21 (1969), 1354–1360.
2. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
3. C. Jordan, Calculus of Finite Differences, Chelsea, 1947 (Second Ed.).
4. L. A. Lee, On Chromatically Equivalent Graphs, Doctoral Dissertation, George Washington University, 1975.
5. R. C. Read, "An Introduction to Chromatic Polynomials," J. Combinatorial Theory 4, (1968), 52–71.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SEER: Super-Optimization Explorer for High-Level Synthesis using E-graph Rewriting;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2;2024-04-27
2. Integral-root polynomials and chromatic uniqueness of graphs;Journal of Discrete Mathematical Sciences and Cryptography;2021-05-19
3. The chromaticity of a family of 6-bridge graph;Journal of Physics: Conference Series;2017-09
4. Chromatic uniqueness of 6-bridge graph θ(3,3,b,c,c,c);AIP Conference Proceedings;2017
5. Chromaticity of 6-bridge graph θ(3,3,3,b,c,d);AIP Conference Proceedings;2015