Common matching number of a graph

DOI10.1016/J.DAM.2025.06.014MaRDI QIDQ6930351zbMATH OpenFDO

Authors Magda Dettlaff, Magdalena Lemańska, Jerzy Topp

Publication date 16 September 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.06.014

zbMATH Keywords

common matching numberdomination numbermatching number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Common edge independence number of a tree (brief announcement)
• Edge-stable equimatchable graphs
• Equimatchable bipartite graphs
• Equimatchable factor‐critical graphs
• scientific article; zbMATH DE number 3873377 (Why is no real title available?)
• scientific article; zbMATH DE number 5717196 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 795022 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• Matching theory
• Matching theory -- a sampler: From Dénes König to the present
• Matching-perfect and cover-perfect graphs
• Randomly matchable graphs
• Some covering concepts in graphs
• WELL-COVERED GRAPHS: A SURVEY
• Well-indumatched Trees and Graphs of Bounded Girth

This page was built for publication: Common matching number of a graph

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