On the number of bi-colored graphs.
Frank Harary
Source: Pacific J. Math. Volume 8, Number 4
(1958), 743-755.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.pjm/1103039700
Zentralblatt MATH identifier: 0084.19402
Mathematical Reviews number (MathSciNet): MR0103834
References
[1] G. A. Dirac, The structure of k-chromatic graphs, Fund. Math. 40 (1953), 42-55.
Mathematical Reviews (MathSciNet): MR15:640a
Zentralblatt MATH: 0053.13102
[2] F. Harary, The number of linear, directed rooted and connected graphs. Trans. Amer.Math. Soc. 78 (1955), 445-463.
Mathematical Reviews (MathSciNet): MR16:844b
Zentralblatt MATH: 0065.16702
[3] F. Harary, On the number of dissimilarline-subgraphsof a given graph, Pacific. J. Math., 6 (1956), 57-64.
Mathematical Reviews (MathSciNet): MR18:56i
Zentralblatt MATH: 0071.17604
[4] F. Harary, The number of dissimilar super graphs of a linear graph, Pacific J. Math, 7 (1957),903-911.
Mathematical Reviews (MathSciNet): MR19:379e
Zentralblatt MATH: 0078.16505
[5] F. Harary, On the notion of balance of a signed graph, Michigan Math. J. 2 (1953-54), 143-146.
Mathematical Reviews (MathSciNet): MR16:733h
Zentralblatt MATH: 0056.42103
[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.
Mathematical Reviews (MathSciNet): MR2:65d
Zentralblatt MATH: 0024.00102
[8] D. Slepian, On the number of symmetry types of boolean functions of n variables, Canadion J. Math. 5 (1953), 185-193.
Mathematical Reviews (MathSciNet): MR15:93f
Zentralblatt MATH: 0051.24802
Pacific Journal of Mathematics
