A polynomial algorithm for computing the weak rupture degree of trees (Q2279643): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2019.06.019
@@ Property / DOI: 10.1016/j.amc.2019.06.019 / rank @@
-Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Q3123938
@@ Property / cites work: Q3123938 / rank @@
+Normal rank
@@ Property / cites work @@
+Rupture degree of graphs
@@ Property / cites work: Rupture degree of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On edge-rupture degree of graphs
@@ Property / cites work: On edge-rupture degree of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3175377
@@ Property / cites work: Q3175377 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127676326
@@ Property / Wikidata QID: Q127676326 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2019.06.019
@@ Property / DOI: 10.1016/J.AMC.2019.06.019 / rank @@
+Normal rank