1. Lecture Notes;Chao,1978
2. A higher invariant for matroids
3. Characterization of a polygonal graph by means of its chromatic polynomial. In Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing. Utilitas, Winnipeg (1973), pp. 275–278.
4. A theorem on n-connected graphs