The 2-Factor Polynomial Detects Even Perfect Matchings
-
Published:2020-05-29
Issue:2
Volume:27
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Baldridge Scott,Lowrance Adam M.,McCarty Ben
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On ribbon graphs and virtual links;European Journal of Combinatorics;2022-06