A note on the computation on the k-closure of a graph (Q1108040): 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/0020-0190(87)90148-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2028291445
@@ Property / OpenAlex ID: W2028291445 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625199
@@ Property / cites work: Q5625199 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q5722819
@@ Property / cites work: Q5722819 / rank @@
+Normal rank