[[1] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.]Search in Google Scholar
[[2] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.]Search in Google Scholar
[[3] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.]Search in Google Scholar
[[4] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.]Search in Google Scholar
[[5] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.]Search in Google Scholar
[[6] Czesław Byliński and Piotr Rudnicki. The correspondence between monotonic many sorted signatures and well-founded graphs. Part I. Formalized Mathematics, 5(4):577– 582, 1996.]Search in Google Scholar
[[7] Gary Chartrand. Introductory Graph Theory. New York: Dover, 1985.]Search in Google Scholar
[[8] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.]Search in Google Scholar
[[9] Krzysztof Hryniewiecki. Graphs. Formalized Mathematics, 2(3):365–370, 1991.]Search in Google Scholar
[[10] Yatsuka Nakamura and Piotr Rudnicki. Euler circuits and paths. Formalized Mathematics, 6(3):417–425, 1997.]Search in Google Scholar
[[11] Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25–34, 1990.]Search in Google Scholar
[[12] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.]Search in Google Scholar
[[13] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990. Received June 16, 2014]Search in Google Scholar
