On critical difference, independence number and matching number of graphs
DOI10.1007/S00373-023-02690-4zbMATH Open1519.05207OpenAlexW4385606725MaRDI QIDQ6133662FDOQ6133662
Authors:
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
Recommendations
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
- Ear-decompositions of matching-covered graphs
- Matching theory
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
- Critical independent sets and König-Egerváry graphs
- A characterization of the graphs in which the transversal number equals the matching number
- Vertices belonging to all critical sets of a graph
- On the number of vertices belonging to all maximum stable sets of a graph
- Problems on matchings and independent sets of a graph
- On the structure of the minimum critical independent set of a graph
- Critical and maximum independent sets revisited
- Critical independent sets of König-Egerváry graphs
- On the critical difference of almost bipartite graphs
Cited In (2)
This page was built for publication: On critical difference, independence number and matching number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133662)
