Properties of \(\theta\)-super positive graphs

zbMath1243.05117arXiv0912.4100MaRDI QIDQ426799

Cheng Yeaw Ku, Kok Bin Wong

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.4100

zbMATH Keywords

matching polynomialextreme setsGallai-Edmonds decompositionbarrier setselementary graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ A refined Gallai-Edmonds structure theorem for weighted matching polynomials

This page was built for publication: Properties of \(\theta\)-super positive graphs