The structure of Eta graph with |V (g)| + 4 maximum matchings

zbMATH Open1449.05218MaRDI QIDQ5210293FDOQ5210293

Authors: Chunxia Yang, Lihao Wu 

Publication date: 22 January 2020

Recommendations

• Characterizations of maximum matching graphs of certain types
• Graphs isomorphic to their maximum matching graphs
• The connectivity of maximum matching graphs
• Sharp bounds for the number of matchings in generalized-theta-graphs
• Distance between two vertices of maximum matching graphs

zbMATH Keywords

maximum matchingsEta graphpending path

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

This page was built for publication: The structure of Eta graph with \(|V (g)| + 4\) maximum matchings

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