Pages that link to "Item:Q625411"
From MaRDI portal
The following pages link to Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs (Q625411):
Displaying 8 items.
- Generalizing Tutte's theorem and maximal non-matchable graphs (Q390291) (← links)
- Extensions of barrier sets to nonzero roots of the matching polynomial (Q607015) (← links)
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial (Q641190) (← links)
- On the roots of edge cover polynomials of graphs (Q648996) (← links)
- Algebraic matching theory (Q1804180) (← links)
- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences (Q2248725) (← links)
- Gallai-Edmonds structure theorem for weighted matching polynomial (Q2435543) (← links)
- (Q4980149) (← links)