Geodesic
Kasteleyn's Theorem and Arbitrary Graphs
Canadian journal of mathematics, Tome 25 (1973) no. 4, pp. 758-764

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

Familiarity with the basic notions of graph theory is assumed. Loops and multiple edges are not permitted. An orientation of an edge e of a graph G is a designation of one of the ends of e as the positive end and the other as the negative end. We say that e is oriented from the positive end to the negative end. If e joins vertex v to vertex w and v is the positive end of e, we write e = (v, w). An orientation of G is a set of orientations, one for each edge of G; a graph with an orientation is called a directed graph. 
Little, Charles H. C. Kasteleyn's Theorem and Arbitrary Graphs. Canadian journal of mathematics, Tome 25 (1973) no. 4, pp. 758-764. doi: 10.4153/CJM-1973-077-1
@article{10_4153_CJM_1973_077_1,
     author = {Little, Charles H. C.},
     title = {Kasteleyn's {Theorem} and {Arbitrary} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {758--764},
     year = {1973},
     volume = {25},
     number = {4},
     doi = {10.4153/CJM-1973-077-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-077-1/}
}
TY  - JOUR
AU  - Little, Charles H. C.
TI  - Kasteleyn's Theorem and Arbitrary Graphs
JO  - Canadian journal of mathematics
PY  - 1973
SP  - 758
EP  - 764
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-077-1/
DO  - 10.4153/CJM-1973-077-1
ID  - 10_4153_CJM_1973_077_1
ER  - 
%0 Journal Article
%A Little, Charles H. C.
%T Kasteleyn's Theorem and Arbitrary Graphs
%J Canadian journal of mathematics
%D 1973
%P 758-764
%V 25
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-077-1/
%R 10.4153/CJM-1973-077-1
%F 10_4153_CJM_1973_077_1

[1] 1. Kasteleyn, P. W., Graph theory and crystal physics, in Harary, F., ed., Graph Theory and Theoretical Physics (Academic Press, London, 1967), pp. 43-110. Google Scholar

[2] 2. Cayley, A., Sur les déterminants gauches, Crelle's J. 88 (1847), 93–94. Google Scholar

[3] 3. Halton, J., A combinatorial proof of Cayley1 s theorem on Pfaffians, J. Combinatorial Theory 1 (1966), 224–232. Google Scholar

[4] 4. Pla, J.-M., Sur l’utilisation d'un Pfaffien dans l’étude des couplages parfaits d'un graphe, C.R. Acad. Sci. Paris Sér. A-B 260 (1965), 2967–2970. Google Scholar

Cité par Sources :