| Line 1,084: |
Line 1,084: |
| | ===H=== | | ===H=== |
| | | | |
| − | * Harary, F., | + | * Harary, F., ''Graph Theory'', Addison-Wesley, Reading, MA, 1969. |
| − | 'Graph Theory',
| |
| − | Addison-Wesley, Reading, MA, 1969.
| |
| | | | |
| − | * Harary, F. & Palmer, E.M., | + | * Harary, F., and Palmer, E.M., ''Graphical Enumeration'', Academic Press, New York, NY, 1973. |
| − | 'Graphical Enumeration',
| |
| − | Academic Press, New York, NY, 1973.
| |
| | | | |
| − | * Hoffmann, C.M., | + | * Hoffmann, C.M., ''Group-Theoretic Algorithms and Graph Isomorphism'', Lecture Notes in Computer Science, Volume 136, G. Goos and J. Hartmanis (eds.), Springer-Velag, Berlin, 1982. |
| − | 'Group-Theoretic Algorithms and Graph Isomorphism',
| |
| − | Lecture Notes in Computer Science, Volume 136, | |
| − | Edited by: G. Goos & J. Hartmanis, Springer-Velag, Berlin, 1982.
| |
| | | | |
| − | * Holland, J.H., Holyoak, K.J., Nisbett, R.E., & Thagard, P.R., | + | * Holland, J.H., Holyoak, K.J., Nisbett, R.E., and Thagard, P.R., ''Induction : Processes of Inference, Learning, and Discovery'', MIT Press, Cambridge, MA, 1986. |
| − | 'Induction: Processes of Inference, Learning, and Discovery',
| |
| − | MIT Press, Cambridge, MA, 1986.
| |
| | | | |
| | ===I=== | | ===I=== |