Document Type

Article

Publication Date

1-1-2020

Abstract

In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2-factors that contain the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings.

Publication Source (Journal or Book title)

Electronic Journal of Combinatorics

First Page

1

Last Page

16

Download
COinS