Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589): Difference between revisions

@@ Property / author @@
-Najiba Sbihi
@@ Property / author: Najiba Sbihi / rank @@
-Normal rank
@@ Property / author @@
+Najiba Sbihi
@@ Property / author: Najiba Sbihi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4096964
@@ Property / cites work: Q4096964 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3895513
@@ Property / cites work: Q3895513 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q5620998
@@ Property / cites work: Q5620998 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1144589