A refined Gallai-Edmonds structure theorem for weighted matching polynomials
From MaRDI portal
Publication:2111908
DOI10.1016/J.DISC.2022.113244OpenAlexW3037510684WikidataQ122417721 ScholiaQ122417721MaRDI QIDQ2111908FDOQ2111908
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.15215
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Continued fractions (11A55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Theory of monomer-dimer systems
- Paths, Trees, and Flowers
- On the theory of the matching polynomial
- Algebraic matching theory
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- Matchings and walks in graphs
- Gallai-Edmonds structure theorem for weighted matching polynomial
- Generalizing Tutte's theorem and maximal non-matchable graphs
- Properties of \(\theta\)-super positive graphs
- Extensions of barrier sets to nonzero roots of the matching polynomial
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial
Cited In (1)
Recommendations
This page was built for publication: A refined Gallai-Edmonds structure theorem for weighted matching polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111908)
