Enumeration of mixed graphs
HTML articles powered by AMS MathViewer
- by Frank Harary and Ed Palmer PDF
- Proc. Amer. Math. Soc. 17 (1966), 682-687 Request permission
References
- Robert L. Davis, Structures of dominance relations, Bull. Math. Biophys. 16 (1954), 131–140. MR 63006, DOI 10.1007/bf02478368
- Frank Harary, The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc. 78 (1955), 445–463. MR 68198, DOI 10.1090/S0002-9947-1955-0068198-2
- Frank Harary, The number of oriented graphs, Michigan Math. J. 4 (1957), 221–224. MR 101525 —, Combinatorial problems in graphical enumeration, Chapter 6 in Applied Combinatorial Mathematics, E. F. Beckenbach, ed., New York, 1964; pp. 185-217.
- Frank Harary, Robert Z. Norman, and Dorwin Cartwright, Structural models: An introduction to the theory of directed graphs, John Wiley & Sons, Inc., New York-London-Sydney, 1965. MR 0184874
- Frank Harary and Ed Palmer, The power group of two permutation groups, Proc. Nat. Acad. Sci. U.S.A. 54 (1965), 680–682. MR 190019, DOI 10.1073/pnas.54.3.680
- Frank Harary and Ed Palmer, The power group enumeration theorem, J. Combinatorial Theory 1 (1966), 157–173. MR 202635 G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen and chemische Verbindungen, Acta Math. 68 (1937), 145-254.
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 682-687
- MSC: Primary 05.65
- DOI: https://doi.org/10.1090/S0002-9939-1966-0191845-4
- MathSciNet review: 0191845