On critical difference, independence number and matching number of graphs (Q6133662): Difference between revisions

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