The 2-factor polynomial detects even perfect matchings

DOI10.37236/9214zbMath1451.05120arXiv1812.10346OpenAlexW3028960760MaRDI QIDQ2185217

Adam M. Lowrance, Ben McCarty, Scott Baldridge

Publication date: 4 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.10346

zbMATH Keywords

perfect matchinggraph polynomialTait coloringplane cubic graph2-facor

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Knot polynomials (57K14)

Related Items (2)

On ribbon graphs and virtual links ⋮ Unoriented Khovanov homology

Cites Work

• A Tutte polynomial for signed graphs
• Map coloring and the vector cross product
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Lie algebras and the four color theorem
• A Turaev surface approach to Khovanov homology
• Unoriented Khovanov homology
• On ribbon graphs and virtual links
• A state calculus for graph coloring
• The chromatic polynomial of fatgraphs and its categorification
• The Jones polynomial and graphs on surfaces

This page was built for publication: The 2-factor polynomial detects even perfect matchings