The extreme set condition of a graph

DOI10.1016/S0012-365X(02)00534-4MaRDI QIDQ1861250zbMATH OpenOpenAlexFDO

Authors Jianxiu Hao, Shiying Wang

Publication date 16 March 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00534-4

zbMATH Keywords

matchingindependent setdeficiencybarrierextreme set

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3880761
• The extremal graphs with respect to their nullity
• An extremal problem for sets with applications to graph theory
• scientific article; zbMATH DE number 3788665
• An extremal problem in graph theory
• An extremal problem in graph theory
• Publication:5753977
• scientific article; zbMATH DE number 863492
• scientific article; zbMATH DE number 2123255
• scientific article; zbMATH DE number 3841900

Cited in

(5)

• scientific article; zbMATH DE number 1916987 (Why is no real title available?)
• Extensions of barrier sets to nonzero roots of the matching polynomial
• Nondeficient sets in graphs
• Generalizing \(D\)-graphs
• A note on extreme sets

This page was built for publication: The extreme set condition of a graph

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