Toughness and binding number (Q2448921): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.08.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2011033652
@@ Property / OpenAlex ID: W2011033652 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of recognizing tough cubic graphs
@@ Property / cites work: The complexity of recognizing tough cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the binding number of a graph
@@ Property / cites work: Computing the binding number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the Toughness of a Graph
@@ Property / cites work: On the Toughness of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503106
@@ Property / cites work: Q4503106 / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank