Regular graphs with equal matching number and independence number

DOI10.1016/j.dam.2021.12.023zbMath1482.05240arXiv2001.01937OpenAlexW4221059925MaRDI QIDQ2074360

Hongliang Lu, Zi-Xuan Yang

Publication date: 9 February 2022

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

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

zbMATH Keywords

independence numbermatching numberregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Critical sets in bipartite graphs
• A characterization of the graphs in which the transversal number equals the matching number
• The critical independence number and an independence decomposition
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• On the number of vertices belonging to all maximum stable sets of a graph
• Cubic graphs with equal independence number and matching number
• Forbidden subgraphs and the König-Egerváry property
• On maximum matchings in König-Egerváry graphs

This page was built for publication: Regular graphs with equal matching number and independence number