1 |
C. A. Athanasiadis, Characteristic polynomials of subspace arrangements and finite fields, Adv. Math. 122 (1996), no. 2, 193-233.
DOI
|
2 |
P. Hanlon, The enumeration of bipartite graphs, Discrete Math. 28 (1979), no. 1, 49-57.
DOI
|
3 |
F. Harary, On the number of bi-colored graphs, Pacific J. Math. 8 (1958), 743-755.
DOI
|
4 |
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York-London, 1973.
|
5 |
F. Harary and G. Prins, Enumeration of bicolourable graphs, Canad. J. Math. 15 (1963), 237-248.
DOI
|
6 |
J. Song, Characteristic polynomial of certain hyperplane arrangements through graph theory, (accepted for publication) arXiv:1701.07330 [math.CO].
|
7 |
J. Song, Enumeration of graphs with given weighted number of connected components, Bull. Korean. Math. Soc. (accepted for publication) arXiv:1606.08001 [math.CO].
|
8 |
J. Song, On certain hyperplane arrangements and colored graphs, Bull. Korean Math. Soc. 54 (2017), no. 2, 375-382.
DOI
|
9 |
R. P. Stanley, Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 1999.
|
10 |
M. Ueno and S. Tazawa, Enumeration of bipartite self-complementary graphs, Graphs Combin. 30 (2014), no. 2, 471-477.
DOI
|
11 |
T. Zaslavsky, Counting the faces of cut-up spaces, Bull. Amer. Math. Soc. 81 (1975), no. 5, 916-918.
DOI
|
12 |
T. Zaslavsky, The geometry of root systems and signed graphs, Amer. Math. Monthly 88 (1981), no. 2, 88-105.
DOI
|
13 |
T. Zaslavsky, Bicircular geometry and the lattice of forests of a graph, Quart. J. Math. Oxford Ser. (2) 33 (1982), 493-511.
DOI
|
14 |
T. Zaslavsky, Signed graph coloring, Discrete Math. 39 (1982), no. 2, 215-228.
DOI
|