Generalizing \(D\)-graphs

DOI10.1016/J.DAM.2007.06.017zbMath1247.05186OpenAlexW2079211849MaRDI QIDQ2462386

Michael Ferrara, Arthur H. Busch, Nathan Kahl

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.017

zbMATH Keywords

matchingextreme setbarrier set\(D\)-graphtutte set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ A note on extreme sets

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• The extreme set condition of a graph
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Tutte sets in graphs I: Maximal tutte sets and D-graphs

This page was built for publication: Generalizing \(D\)-graphs