Chain hexagonal cacti: Matchings and independent sets
- 28 June 2010
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 310 (12), 1676-1690
- https://doi.org/10.1016/j.disc.2009.11.026
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient Algorithms for the Weighted 2-Center Problem in a Cactus GraphLecture Notes in Computer Science, 2005
- Vertex and Tree Arboricities of GraphsJournal of Combinatorial Optimization, 2004
- The bilayer Ising model and a generalized Husimi tree approximationPhysica A: Statistical Mechanics and its Applications, 2003
- Compared to what? An introduction to the analysis of algorithmsScience of Computer Programming, 1995
- Exact dimer statistics and characteristic polynomials of cacti latticesTheoretical Chemistry Accounts, 1989
- Matchings in hexagonal cactiInternational Journal of Mathematics and Mathematical Sciences, 1987
- An introduction to matching polynomialsJournal of Combinatorial Theory, Series B, 1979
- The Dissimilarity Characteristic of Husimi TreesAnnals of Mathematics, 1953
- On the Number of Husimi TreesProceedings of the National Academy of Sciences of the United States of America, 1953
- Note on Mayers' Theory of Cluster IntegralsThe Journal of Chemical Physics, 1950