On Switching to <i>H</i>‐Free Graphs (Q5417832): Difference between revisions

@@ Property / cites work @@
+The bi-join decomposition
@@ Property / cites work: The bi-join decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Pancyclicity in switching classes
@@ Property / cites work: Pancyclicity in switching classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Recognizing \(P_ 3\)-structure: A switching approach
+Normal rank
@@ Property / cites work @@
+On perfect switching classes
@@ Property / cites work: On perfect switching classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035339
@@ Property / cites work: Q3035339 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Circular permutation graphs
@@ Property / cites work: Circular permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065580
@@ Property / cites work: Q4065580 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4121914
@@ Property / cites work: Q4121914 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm to recognize circular permutation graphs
+Normal rank