Extensions of barrier sets to nonzero roots of the matching polynomial

DOI10.1016/j.disc.2010.09.002zbMath1200.05109arXiv0909.5249OpenAlexW2014552601MaRDI QIDQ607015

Kok Bin Wong, Cheng Yeaw Ku

Publication date: 19 November 2010

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

Full work available at URL: https://arxiv.org/abs/0909.5249

zbMATH Keywords

matching polynomialextreme setsGallai-Edmonds decompositionbarrier sets

Mathematics Subject Classification ID

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

Related Items (4)

Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ A refined Gallai-Edmonds structure theorem for weighted matching polynomials

Cites Work

• Generalizing Tutte's theorem and maximal non-matchable graphs
• Properties of \(\theta\)-super positive graphs
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Matching theory
• Problems in algebraic combinatorics
• Algebraic matching theory
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
• On the theory of the matching polynomial

This page was built for publication: Extensions of barrier sets to nonzero roots of the matching polynomial