Gaphical enumeration problems

F. Harary

Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 24 (1969) no. 5

Bibliographie

[1] K. Berzh, Teoriya grafov i ee primeneniya, perev. s frants., IL, M., 1962

[2] W. G. Brown, “Enumeration of triangulations of the disk”, Proc. London Math. Soc., 14 (1964), 746–768 | DOI | MR | Zbl

[3] W. G. Brown, “Enumeration of quadrangular dissections of the disk”, Canad. J. Math., 17 (1965), 302–317 | MR | Zbl

[4] W. G. Brown, “Historical note on a recurrent combinatorial problem”, Amer. Math. Monthly, 72 (1965), 973–977 | DOI | MR | Zbl

[5] W. G. Brown, “On the enumeration of non-planar maps”, Memoirs Amer. Math. Soc., 1967 | MR

[6] W. G. Brown, W. T. Tutte, “On the enumeration of rooted, non-separable planar maps”, Canad. J. Math., 16 (1964), 574–577 | MR

[7] W. Burnside, Theory of Groups of Finite Order, University Press, Cambridge, 1911 | Zbl

[8] B. Busacker, T. Saaty, Finite Graphs and Networks, McGraw-Hill, New York, 1965 | Zbl

[9] G. A. Dirac, S. Schuster, “A theorem of Kuratowski”, Nederl. Akad. Wetensch. Proc., Ser. A, 57 (1954), 343–348 | MR | Zbl

[10] J. W. Evans, F. Harary, M. S. Lynn, “On the computer enumeration of finite topologies”, Comm. Assoc. Comp. Mach., 10 (1967), 295–297 | Zbl

[11] J. Folkman, “Regular line symmetric graphs”, J. Combinatorial Theory, 2 (1967) | MR

[12] G. W. Ford, G. E. Uhlenbeck, “Combinatorial problems in the theory of graphs”, Proc. Nat. Acad. Sci. U.S.A., 42 (1956), 122–128 ; 203–208 ; 529–535 | DOI | MR | Zbl | Zbl | Zbl

[13] R. Frucht, “Graphs of degree 3 with a given abstract group”, Canad. J. Math., 1 (1949), 365–378 | MR | Zbl

[14] E. N. Gilbert, “Gray codes and paths on the $n$-cube”, Bell System Tech. J., 37 (1958), 815–826 | MR

[15] S. W. Golomb, Polyominoes, Scribner's, New York, 1965

[16] S. W. Golomb, “Tiling with polyominoes”, J. Combinatorial Theory, 1 (1966) | MR

[17] F. Harary, “The number of linear, directed, rooted, and connected graphs”, Trans. Amer. Math. Soc., 78 (1955), 445–463 | DOI | MR | Zbl

[18] F. Harary, “On the number of dissimilar line-subgraphs of a given graph”, Pacific J. Math., 6 (1956), 57–64 | MR | Zbl

[19] F. Harary, “On the number of bicolored graphs”, Pacific J. Math., 8 (1958), 743–755 | MR | Zbl

[20] F. Harary, “The exponentiation of permutation groups”, Amer. Math. Monthly, 66 (1959), 572–575 | DOI | MR | Zbl

[21] F. Harary, “Unsolved problems in the enumeration of graphs”, Publ. Math. Inst. Hungar. Acad. Sci., 5 (1960), 63–95 | MR | Zbl

[22] F. Harary, “Permutations with restricted position”, Math. of Computation, 16 (1962), 222–226 | DOI | Zbl

[23] F. Harary, “A characterization of block-graphs”, Canad. Math. Bull., 6 (1963), 1–6 | MR | Zbl

[24] F. Kharari, “Kombinatornye zadachi perechisleniya grafov”, Prikladnaya kombinatornaya matematika, sb., perev. s angl., Mir, M., 1968

[25] F. Harary, A Seminar on Graph Theory, Holt, Rinehart and Winston, New York, 1967 | MR | Zbl

[26] F. Harary, E. M. Palmer, “The power group of two permutation groups”, Proc. Nat. Acad. Sci. U.S.A., 54 (1965a), 680–682 | DOI | MR | Zbl

[27] F. Harary, E. M. Palmer, “The number of graphs rooted at an oriented line”, ICC Bull., 4 (1965b), 91–98 | MR

[28] F. Harary, E. M. Palmer, “On the number of orientations of a given graph”, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys., 14 (1966a), 125–128 | MR | Zbl

[29] F. Harary, E. M. Palmer, “Enumeration of mixed graphs”, Proc. Amer. Math. Soc., 17 (1966b), 682–687 | DOI | MR | Zbl

[30] F. Harary, E. M. Palmer, “Enumeration of locally restricted digraphs”, Canad. J. Math., 18 (1966c), 853–860 | MR | Zbl

[31] F. Harary, E. M. Palmer, “The power group enumeration theorem”, J. Combinatorial Theory, 1 (1966d), 157–173 | DOI | MR | Zbl

[32] F. Harary, E. M. Palmer, “Enumeration of self converse digraphs”, Mathematika, 13 (1966e), 151–157 | MR | Zbl

[33] F. Harary, E. M. Palmer, “The enumeration methods of Redfield”, Amer. J. Math., 1967 | MR

[34] F. Harary, E. M. Palmer, “Enumeration of finite automata”, Information and Control, 10 (1967) | DOI | MR

[35] F. Harary, E. M. Palmer, “The groups of the small digraphs”, J. Indian Stat. Assoc., 1967

[36] F. Harary, E. M. Palmer, “On the number of balanced signed graphs”, Bull. Math. Biophysics, 1967

[37] F. Harary, M. D. Plummer, “On the core of a graph”, Proc. London Math. Soc., 17 (1967), 305–314 | DOI | MR | Zbl

[38] F. Harary, G. Prins, “Enumeration of bicolourable graphs”, Canad. J. Math., 15 (1963), 237–248 | MR | Zbl

[39] F. Harary, G. Prins, “On the block-cutpoint-tree of a graph”, Publ. Math. Debrecen, 13 (1966), 103–107 | MR | Zbl

[40] F. Harary, W. T. Tutte, “The number of plane trees with a given partition”, Mathematika, 11 (1964), 99–101 | MR | Zbl

[41] F. Harary, R. Z. Norman, D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs, Wiley, New York, 1965 | MR | Zbl

[42] F. Harary, G. Prins, W. T. Tutte, “The number of plane trees”, Nederl. Akad. Wetensch., Ser. A, 67 (1964), 319–329 | MR | Zbl

[43] M. S. Harrison, “A census of finite automata”, Canad. J. Math., 17 (1965), 100–113 | MR | Zbl

[44] E. Ising, “Beitrag zur Theorie des Ferromagnetismus”, Z. Physik, 31 (1925), 253–258 | DOI

[45] D. A. Klarner, “Some results concerning polyominoes”, Fibonacci Quart., 3 (1965) | MR | Zbl

[46] D. König, Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft, Leipzig, 1936 ; Chelsea, New York, 1950 | MR | Zbl

[47] J. Krausz, “Démonstration nouvelle d'une théoreme de Whitney sur les reseaux (Hungarian)”, Math. Fiz. Lapok, 50 (1943), 75–85 | MR | Zbl

[48] V. Krishnamurthy, “On the number of topologies on a finite set”, Amer. Math. Monthly, 73 (1966), 154–157 | DOI | MR | Zbl

[49] R. C. Mullin, “Enumeration of rooted triangular maps”, Amer. Math. Monthly, 71 (1964), 1007–1010 | DOI | MR | Zbl

[50] R. C. Mullin, “On counting rooted triangular maps”, Canad. J. Math., 17 (1965) | MR | Zbl

[51] R. C. Mullin, “On the average number of trees in certain maps”, Canad. J. Math., 18 (1966), 33–41 | MR | Zbl

[52] L. Onsager, “Crystal statistics. I: A two dimensional model with an order-disorder transition”, Phys. Rev., 65 (1944), 117–149 | DOI | MR | Zbl

[53] O. Ore, Teoriya grafov, perev. s angl., «Nauka», M., 1968 | MR

[54] O. Ore, Graphs and Their Uses, Random House, New York, 1963 | MR | Zbl

[55] E. M. Palmer, R. W. Robinson, “The matrix group of two permutation groups”, Bull. Amer. Math. Soc., 73 (1967), 204–207 | DOI | MR | Zbl

[56] K. R. Parthasarathy, “Enumeration of graphs with given partition”, Canad. J. Math., 20:1 (1968), 40–47 | MR | Zbl

[57] G. Pólya, “Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen”, Acta Math., 68 (1937), 145–254 | DOI

[58] G. Pólya, “Sur les types des propositions composées”, J. Symbolic Logic, 5 (1940) | MR

[59] C. E. Radke, “Enumeration of strongly connected sequential machines”, Information and Control, 8 (1965), 377–389 | DOI | MR | Zbl

[60] R. C. Read, “Contributions to the cell-growth problem”, Canad. J. Math., 14 (1962), 1–20 | MR | Zbl

[61] R. C. Read, “On the number of self-complementary graphs and digraphs”, J. London Math. Soc., 38 (1963), 99–104 | DOI | MR | Zbl

[62] J. Riordan, C. E. Shannon, “The number of two-terminal series-parallel networks”, J. Math. Phys., 21 (1942), 83–93 | MR

[63] Dzh. Riordan, Vvedenie v kombinatornyi analiz, perev. s angl., IL, M., 1963

[64] R. W. Robinson, The enumeration of $k$-colored graphs

[65] R. W. Robinson, The enumeration of blocks

[66] R. W. Robinson, The enumeration of homeomorphically irreducible graphs

[67] G. Dzh. Raizer, Kombinatornaya matematika, perev. s angl., «Mir», M., 1966

[68] G. Sabidussi, “Graph derivatives”, Math. Z., 76 (1961), 385–401 | DOI | MR | Zbl

[69] S. Seshu, M. Reed, Linear Graphs and Electrical Networks, Addison-Wesley, Reading, 1961 | MR | Zbl

[70] S. Sherman, “Combinatorial aspects of the Ising model for ferromagnetism. I: A conjecture of Feynman on paths and graphs”, J. Math. Phys., 1 (1960), 202–217 | DOI | MR

[71] D. Slepian, “On the number of symmetry types of Boolean functions of $n$ variables”, Canad. J. Math., 5 (1953), 185–193 | MR | Zbl

[72] J. Turner, “Point symmetric graphs with a prime number of points”, J. Combinatorial Theory, 3 (1967) | MR | Zbl

[73] W. T. Tutte, C. A. B. Smith, “On universal paths in a network of degree 4”, Amer. Math. Monthly, 48 (1941), 233–237 | DOI | MR

[74] W. T. Tutte, “A census of planar triangulations”, Canad. J. Math., 14 (1962), 21–38 | MR | Zbl

[75] W. T. Tutte, “A census of Hamiltonian polygons”, Canad. J. Math., 14 (1962), 402–417 | MR | Zbl

[76] W. T. Tutte, “A census of slicings”, Canad. J. Math., 14 (1962), 708–722 | MR | Zbl

[77] W. T. Tutte, “A census of planar maps”, Canad. J. Math., 15 (1963), 249–271 | MR | Zbl

[78] W. T. Tutte, “The number of planted plane trees with a given partition”, Amer. Math. Monthly, 71 (1964), 272–277 | DOI | MR | Zbl

[79] W. T. Tutte, Connectivity in Graphs, Toronto University Press, Toronto, 1966 | MR | Zbl

[80] F. Ya. Vetukhnovskii, “O chisle nerazlozhimykh setei i nekotorykh ikh svoistvakh”, DAN, 123 (1958), 391–394

[81] H. Whitney, “Congruent graphs and the connectivity of graphs”, Amer. J. Math., 54 (1932), 150–168 | DOI | MR

[82] H. Whitney, “Non-separable and planar graphs”, Trans. Amer. Math. Soc., 34 (1932), 339–362 | DOI | MR

[83] F. Harary, “The cell growth problem and its attempted solutions”, Beitr. Graphentheorie, Internat. Kolloq. (Manebach, 1967), Leipzig, 1968, 49–60 | Zbl

[84] F. Harary, E. M. Palmer, “On acyclici simplicial complexes”, Mathematika, 15:1 (1968), 115–122 | MR | Zbl

[85] D. A. Klarner, “The number of $k$-coloured graphs”, Canad. J. Math., 20:6 (1968), 1344–1352 | MR | Zbl