Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
From MaRDI portal
Publication:625411
zbMath1229.05121MaRDI QIDQ625411
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
05C31: Graph polynomials
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Generalizing Tutte's theorem and maximal non-matchable graphs, Extensions of barrier sets to nonzero roots of the matching polynomial, Generalized \(D\)-graphs for nonzero roots of the matching polynomial, Gallai-Edmonds structure theorem for weighted matching polynomial