Computing the Scattering Number of Graphs (Q4780531): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160211919
+Normal rank
@@ Property / OpenAlex ID @@
+W2092855865
@@ Property / OpenAlex ID: W2092855865 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692501
@@ Property / cites work: Q4692501 / 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 @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 @@
+Q4871072
@@ Property / cites work: Q4871072 / rank @@
+Normal rank
@@ Property / cites work @@
+THE MAXIMUM CONNECTIVITY OF A GRAPH
@@ Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+A catalogue of small maximal nonhamiltonian graphs
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge‐tenacious networks
@@ Property / cites work: Edge‐tenacious networks / rank @@
+Normal rank
@@ Property / cites work @@
+Scattering number in graphs
@@ Property / cites work: Scattering number in graphs / rank @@
+Normal rank