On critical difference, independence number and matching number of graphs
From MaRDI portal
Publication:6133662
Recommendations
Cites work
- A characterization of the graphs in which the transversal number equals the matching number
- Critical and maximum independent sets revisited
- Critical independent sets and König-Egerváry graphs
- Critical independent sets of König-Egerváry graphs
- Ear-decompositions of matching-covered graphs
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Matching theory
- On the critical difference of almost bipartite graphs
- On the number of vertices belonging to all maximum stable sets of a graph
- On the structure of the minimum critical independent set of a graph
- Problems on matchings and independent sets of a graph
- Vertices belonging to all critical sets of a graph
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)