1 |
F. Harary, On the number of bi-colored graphs, Pacific J. Math. 8 (1958), 743-755.
DOI
|
2 |
F. Harary and E. M. Palmer, Graphical enumeration, Academic Press, New York- London, 1973.
|
3 |
F. Harary and G. Prins, Enumeration of bicolourable graphs, Canad. J. Math. 15 (1963), 237-248.
DOI
|
4 |
T. W. Melnyk, J. S. Rowlinson, and B. L. Sawford, The penetrable sphere and related models of liquid vapour equilibrium, Molecular Physics 24 (1972), no. 4, 809-831.
DOI
|
5 |
R. C. Read, Some enumeration problems in graph theory, Doctoral Thesis, University of London, 1958.
|
6 |
R. C. Read, The number of k-colored graphs on labelled nodes, Canad. J. Math. 12 (1960), 410-414.
DOI
|
7 |
J. Song, Characteristic polynomial of certain hyperplane arrangements through graph theory, (submitted for publication), arXiv:1701.07330 [math.CO].
|
8 |
J. Song, Enumeration of graphs and the characteristic polynomial of the hyperplane arrangements Jn, J. Korean Math. Soc. (to appear), arXiv:1701.07313 [math.CO].
|
9 |
J. Song, On certain hyperplane arrangements and colored graphs, Bull. Korean Math. Soc. 54 (2017), no. 2, 375-382.
DOI
|
10 |
R. P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge University Press, Cambridge, 1999.
|
11 |
M. Ueno and S. Tazawa, Enumeration of bipartite self-complementary graphs, Graphs Combin. 30 (2014), no. 2, 471-477.
DOI
|
12 |
G. W. Ford, R. Z. Norman, and G. E. Uhlenbeck, Combinatorial problems in the theory of graphs. II, Proc. Nat. Acad. Sci. U. S. A. 42 (1956), 203-208.
|
13 |
P. Hanlon, The enumeration of bipartite graphs, Discrete Math. 28 (1979), no. 1, 49-57.
DOI
|