Extensions of barrier sets to nonzero roots of the matching polynomial (Q607015): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized \(D\)-graphs for nonzero roots of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing Tutte's theorem and maximal non-matchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of \(\theta\)-super positive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank

Revision as of 11:29, 3 July 2024

scientific article
Language Label Description Also known as
English
Extensions of barrier sets to nonzero roots of the matching polynomial
scientific article

    Statements

    Identifiers