Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2

DOI10.1016/0012-365X(81)90269-7zbMath0451.05036MaRDI QIDQ1147718

E. J. Farrell

Publication date: 1981

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

zbMATH Keywords

recurrence relationchainscircuitsmatching polynomialsdefect-d matchingsbasic graphs with cyclomatic number 2

Mathematics Subject Classification ID

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

Cites Work

• On defect-d matchings in graphs
• An introduction to matching polynomials
• The parity of the number of 1-factors of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2