Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T07:36:35.403Z Has data issue: false hasContentIssue false

Kasteleyn's Theorem and Arbitrary Graphs

Published online by Cambridge University Press:  20 November 2018

Charles H. C. Little*
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1973