Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference13 articles.
1. On chromatic equivalence of graphs
2. The Petersen graph is uniquely determined by its chromatic polynomial. Preprint (1988).
3. Graphs such that every two edges are contained in a shortest cycle
4. An improved method for computing the chromatic polynomials of sparse graphs. Research Report CORR 87-20, Department of Combinatorial and Optimization, University of Waterloo (1987).
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献