scientific article; zbMATH DE number 7124297

zbMath1425.05077MaRDI QIDQ5241134

Yaping Mao, Hai-xing Zhao, Zhi-Wei Guo

Publication date: 30 October 2019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypergraphmatching polynomialindependence polynomialline-graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On P-unique hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on recurrence relations for the independence polynomial of hypergraphs
• A new expression for matching polynomials
• Matching polynomials for chains of cycles
• On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
• On linear and semidefinite programming relaxations for hypergraph matching
• Matching polynomials of two classes of graphs
• The independence polynomial of rooted products of graphs
• Independence polynomials of \(k\)-tree related graphs
• Multivariate matching polynomials of cyclically labelled graphs
• An introduction to matching polynomials
• The matching polynomial of a regular graph
• Nearly perfect matchings in regular simple hypergraphs
• Hypergraph theory. An introduction
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• The Size of a Hypergraph and its Matching Number
• On the theory of the matching polynomial
• Near Perfect Matchings ink-Uniform Hypergraphs
• A geometric theory for hypergraph matching

This page was built for publication: