A Berge-keeping operation for graphs (Q2433716): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2005.12.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2148297661
@@ Property / OpenAlex ID: W2148297661 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive generation of partitionable graphs
@@ Property / cites work: Recursive generation of partitionable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing claw-free perfect graphs
@@ Property / cites work: Recognizing claw-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5183521
@@ Property / cites work: Q5183521 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect zero–one matrices
@@ Property / cites work: Perfect zero–one matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A semi-strong perfect graph theorem
@@ Property / cites work: A semi-strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On critical edges in minimal imperfect graphs
@@ Property / cites work: On critical edges in minimal imperfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The connectivity of minimal imperfect graphs
@@ Property / cites work: The connectivity of minimal imperfect graphs / rank @@
+Normal rank