Algebraic matching theory
From MaRDI portal
Publication:1804180
zbMath0818.05063MaRDI QIDQ1804180
Publication date: 25 April 1995
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118622
multiplicitymatchingpathinduced subgraphGallai's lemma\(\theta\)-critical\(\theta\)-essentialalgebraic matching theory
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items (22)
Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners ⋮ THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH ⋮ Graphs with few matching roots ⋮ The independence number of the strong product of cycles ⋮ Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ On matching integral graphs ⋮ Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ On the number of P-vertices of some graphs ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ Null decomposition of trees ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ Graphs whose certain polynomials have few distinct roots ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial ⋮ The acyclic matrices with a P-set of maximum size ⋮ Lower bounds on matching energy of graphs ⋮ Atoms of the matching measure ⋮ Improved lower bound on the Shannon capacity of \(C_7\) ⋮ Trace-minimal graphs and D-optimal weighing designs ⋮ Graphs with six distinct matching roots ⋮ A refined Gallai-Edmonds structure theorem for weighted matching polynomials
This page was built for publication: Algebraic matching theory
