Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs

zbMath1229.05121MaRDI QIDQ625411

Kok Bin Wong, Cheng Yeaw Ku

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\((\theta , G)\)-extremal path coverGallai-Edmonds Structure Theorem for general root

Mathematics Subject Classification ID

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

Related Items (4)

Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ 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

This page was built for publication: Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs