Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Publication:5851114
DOI10.1007/978-3-642-11409-0_26zbMath1273.05180OpenAlexW1586239617MaRDI QIDQ5851114
Ryuhei Uehara, Takeaki Uno, Yoshio Okamoto
Publication date: 21 January 2010
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_26
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
This page was built for publication: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes