Geodesic
On the Number of Parity Sets in a Graph
Canadian journal of mathematics, Tome 28 (1976) no. 6, pp. 1167-1171

Voir la notice de l'article provenant de la source Cambridge University Press

The graphs considered in this paper are finite and have no loops or multiple edges. If G is such a graph, we denote its vertex set by VG and its edge set by EG. If X and Y are disjoint subsets of VG, we define δ (X, Y) to be the set of edges of G that join a vertex in X to one in Y. 
Little, Charles H. C. On the Number of Parity Sets in a Graph. Canadian journal of mathematics, Tome 28 (1976) no. 6, pp. 1167-1171. doi: 10.4153/CJM-1976-115-7
@article{10_4153_CJM_1976_115_7,
     author = {Little, Charles H. C.},
     title = {On the {Number} of {Parity} {Sets} in a {Graph}},
     journal = {Canadian journal of mathematics},
     pages = {1167--1171},
     year = {1976},
     volume = {28},
     number = {6},
     doi = {10.4153/CJM-1976-115-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1976-115-7/}
}
TY  - JOUR
AU  - Little, Charles H. C.
TI  - On the Number of Parity Sets in a Graph
JO  - Canadian journal of mathematics
PY  - 1976
SP  - 1167
EP  - 1171
VL  - 28
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1976-115-7/
DO  - 10.4153/CJM-1976-115-7
ID  - 10_4153_CJM_1976_115_7
ER  - 
%0 Journal Article
%A Little, Charles H. C.
%T On the Number of Parity Sets in a Graph
%J Canadian journal of mathematics
%D 1976
%P 1167-1171
%V 28
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1976-115-7/
%R 10.4153/CJM-1976-115-7
%F 10_4153_CJM_1976_115_7

[1] 1. Little, C. H. C., Kasteleyn s theorem and arbitrary graphs, Can. J. Math. 25 (1973), 758–764. Google Scholar

[2] 2. Harary, F., Graph theory (Addison-Wesley, Reading, Mass., 1969), p. 39. Google Scholar

[3] 3. Kasteleyn, P. W., Graph theory and crystal physics, in Harary, F., éd., Graph theory and theoretical physics (Academic Press, London, 1967), pp. 43–110. Google Scholar

Cité par Sources :