The matching polynomial of a polygraph

DOI10.1016/0166-218X(86)90014-4zbMath0646.05048OpenAlexW2014647881MaRDI QIDQ1103634

Darko Babić, Bojan Mohar, Tomaž Pisanski, Ante Graovac

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90014-4

zbMATH Keywords

algorithmmatching polynomialpolygraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (15)

Dimer problem for some three dimensional lattice graphs ⋮ An infinite family of graphs with a facile count of perfect matchings ⋮ Identifying codes in some subgraphs of the square lattice ⋮ Algebraic approach to fasciagraphs and rotagraphs ⋮ Distance-related invariants on polygraphs ⋮ Hosoya index of thorny polymers ⋮ On the 2-rainbow independent domination numbers of some graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Calculating genus polynomials via string operations and matrices ⋮ A fast numerical method for fractional partial integro-differential equations with spatial-time delays ⋮ Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets ⋮ On ``The matching polynomial of a polygraph ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms

Cites Work

• Matchings in benzene chains
• Domino tilings of rectangles with fixed width
• An introduction to matching polynomials
• Theory of monomer-dimer systems
• Combinatorial methods
• On the theory of the matching polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The matching polynomial of a polygraph