A Pfaffian formula for matching polynomials of outerplanar graphs

DOI10.1080/10556788.2020.1769620zbMath1467.05206OpenAlexW3027598728MaRDI QIDQ4999332

Satoru Iwata

Publication date: 6 July 2021

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2020.1769620

zbMATH Keywords

topological indexmolecular structures

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Nonintersecting paths, pfaffians, and plane partitions
• Efficient Planarity Testing
• The Factorization of Linear Graphs

This page was built for publication: A Pfaffian formula for matching polynomials of outerplanar graphs