On critical difference, independence number and matching number of graphs

DOI10.1007/s00373-023-02690-4zbMath1519.05207OpenAlexW4385606725MaRDI QIDQ6133662

No author found.

Publication date: 21 August 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02690-4

zbMATH Keywords

matching numberindependent numbercritical difference

Mathematics Subject Classification ID

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

Cites Work

• A characterization of the graphs in which the transversal number equals the matching number
• Ear-decompositions of matching-covered graphs
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Problems on matchings and independent sets of a graph
• On the number of vertices belonging to all maximum stable sets of a graph
• Critical independent sets and König-Egerváry graphs
• On the structure of the minimum critical independent set of a graph
• Critical independent sets of König-Egerváry graphs
• On the critical difference of almost bipartite graphs
• Critical and maximum independent sets revisited
• Vertices Belonging to All Critical Sets of a Graph
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems

This page was built for publication: On critical difference, independence number and matching number of graphs