Algebraic matching theory

MaRDI QIDQ1804180zbMATH OpenFDO

Authors Chris Godsil

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, http://www.emis.de/journals/EJC/Volume_2/volume2.html#R8

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

matchinginduced subgraphmultiplicitypathGallai's lemma\(\theta\)-critical\(\theta\)-essentialalgebraic matching theory

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Recommendations

• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• A refined Gallai-Edmonds structure theorem for weighted matching polynomials
• scientific article; zbMATH DE number 2140696
• Generalizing Tutte's theorem and maximal non-matchable graphs

Cited in

(27)

• Matching Energy of Graphs with Maximum Degree at Most 3
• Graphs whose certain polynomials have few distinct roots
• Properties of \(\theta\)-super positive graphs
• Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners
• Lower bounds on matching energy of graphs
• scientific article; zbMATH DE number 2140696 (Why is no real title available?)
• Extensions of barrier sets to nonzero roots of the matching polynomial
• Atoms of the matching measure
• Trace-minimal graphs and D-optimal weighing designs
• Null decomposition of trees
• On matching integral graphs
• On the number of P-vertices of some graphs
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• Graphs with few matching roots
• Gallai-Edmonds structure theorem for weighted matching polynomial
• A refined Gallai-Edmonds structure theorem for weighted matching polynomials
• Improved lower bound on the Shannon capacity of \(C_7\)
• A sheaf-theoretic approach to pattern matching and related problems
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• The independence number of the strong product of cycles
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
• Graphs with six distinct matching roots
• THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Generalizing Tutte's theorem and maximal non-matchable graphs
• The acyclic matrices with a P-set of maximum size
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover

This page was built for publication: Algebraic matching theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804180)