Matchings in hexagonal cacti

DOI10.1155/S0161171287000395MaRDI QIDQ579281zbMATHOpenAlexFDO

Authors E. J. Farrell

Publication date 1987

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46205

zbMATH Keywords

perfect matchingsmatching polynomialsdefect-d matchingshexagonal cactihexagonal crownlinear cactusstar cactus

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• Chain hexagonal cacti: matchings and independent sets
• Perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems
• scientific article; zbMATH DE number 3968626
• A theorem concerning perfect matchings in hexagonal systems
• scientific article; zbMATH DE number 867659
• scientific article; zbMATH DE number 3920526
• Minimum degree distance among cacti with perfect matchings
• scientific article; zbMATH DE number 4041964
• scientific article; zbMATH DE number 4047772

Cited in

(6)

• Matching polynomials for chains of cycles
• The number of matchings of low order in hexagonal systems
• scientific article; zbMATH DE number 3861207 (Why is no real title available?)
• Chain hexagonal cacti: matchings and independent sets
• scientific article; zbMATH DE number 4014767 (Why is no real title available?)
• The \(\rho\)-moments of vertex-weighted graphs

This page was built for publication: Matchings in hexagonal cacti

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579281)