Pacific Journal of Mathematics

On the number of bi-colored graphs.

Frank Harary

Article information

Source
Pacific J. Math., Volume 8, Number 4 (1958), 743-755.

Dates
First available in Project Euclid: 14 December 2004

Permanent link to this document
https://projecteuclid.org/euclid.pjm/1103039700

Mathematical Reviews number (MathSciNet)
MR0103834

Zentralblatt MATH identifier
0084.19402

Subjects
Primary: 05.00
Secondary: 55.00

Citation

Harary, Frank. On the number of bi-colored graphs. Pacific J. Math. 8 (1958), no. 4, 743--755. https://projecteuclid.org/euclid.pjm/1103039700


Export citation

References

  • [1] G. A. Dirac, The structure of k-chromatic graphs, Fund. Math. 40 (1953), 42-55.
  • [2] F. Harary, The number of linear, directed rooted and connected graphs. Trans. Amer.Math. Soc. 78 (1955), 445-463.
  • [3] F. Harary, On the number of dissimilarline-subgraphsof a given graph, Pacific. J. Math., 6 (1956), 57-64.
  • [4] F. Harary, The number of dissimilar super graphs of a linear graph, Pacific J. Math, 7 (1957),903-911.
  • [5] F. Harary, On the notion of balance of a signed graph, Michigan Math. J. 2 (1953-54), 143-146.
  • [6] G. Plya, KombinaiorischeAnzahlbestimmungenfurGruppen,Graphen,und chemishe, Verbindungen. Acta Math. 68 (1937), 145-254.
  • [7] G. Plya, Sur les types des propositions composees, J. Symbolic Logic 5 (1940), 98-103.
  • [8] D. Slepian, On the number of symmetry types of boolean functions of n variables, Canadion J. Math. 5 (1953), 185-193.