1. Two theorems in graph theory;Berge;Proc. Nat. Acad. Sci. USA,1957
2. Efficient algorithms for Petersen's theorem;Biedl;J. Algorithms,2001
3. Edge-coloring bipartite multigraphs in O(ElogD) time;Cole;Combinatorica,2001
4. C. Duncan, M. Goodrich, S. Kobourov, Planarity-preserving clustering and embedding for large planar graphs, Graph Drawing (GD’99), Lecture Notes in Computer Science, Vol. 1731, Springer, Berlin, New York, 1999, pp. 186–196.
5. On representation of subsets;Hall;J. London Math. Soc.,1935