A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (Q4368813): Difference between revisions

@@ label / en / label / en @@
+A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
@@ Property / cites work @@
+Q3035337
@@ Property / cites work: Q3035337 / rank @@
+Normal rank
@@ Property / cites work @@
+Random packings of graphs
@@ Property / cites work: Random packings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3398531
@@ Property / cites work: Q3398531 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomly decomposable graphs
@@ Property / cites work: Randomly decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Randomly matchable graphs
@@ Property / cites work: Randomly matchable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / DOI @@
+.21136/cmj.1996.127306
@@ Property / DOI: 10.21136/cmj.1996.127306 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2739395371
@@ Property / OpenAlex ID: W2739395371 / rank @@
+Normal rank
@@ Property / title @@
+A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (English)
+Normal rank