Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-014-1483-4
@@ Property / DOI: 10.1007/s00373-014-1483-4 / rank @@
-Normal rank
@@ Property / cites work @@
+Node-weighted graphs having the König-Egerváry property
+Normal rank
@@ Property / cites work @@
+Testing for Equality between Maximum Matching and Minimum Node Covering
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Vertices Belonging to All or to No Maximum Stable Sets of a Graph
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of Konig-Egervary graphs using a common property of all maximum matchings
+Normal rank
@@ Property / cites work @@
+Critical independent sets and König-Egerváry graphs
+Normal rank
@@ Property / cites work @@
+A shy invariant of graphs
@@ Property / cites work: A shy invariant of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040780
@@ Property / cites work: Q4040780 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the graphs in which the transversal number equals the matching number
+Normal rank
@@ Property / DOI @@
+.1007/S00373-014-1483-4
@@ Property / DOI: 10.1007/S00373-014-1483-4 / rank @@
+Normal rank