Counting Hamiltonian cycles in bipartite graphs (Q2871195): Difference between revisions

@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5442529
@@ Property / cites work: Q5442529 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5442503
@@ Property / cites work: Q5442503 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings extend to Hamilton cycles in hypercubes
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the theory of hypercube graphs
@@ Property / cites work: A survey of the theory of hypercube graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The number of Latin squares of order 11
@@ Property / cites work: The number of Latin squares of order 11 / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
+Normal rank
@@ Property / cites work @@
+Classification algorithms for codes and designs
@@ Property / cites work: Classification algorithms for codes and designs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4933450
@@ Property / cites work: Q4933450 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of the multi-path algorithm for finding Hamilton cycles
+Normal rank
@@ Property / cites work @@
+Graphs, Algorithms, and Optimization
@@ Property / cites work: Graphs, Algorithms, and Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234989
@@ Property / cites work: Q4234989 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
+Normal rank
@@ Property / cites work @@
+Isomorph-Free Exhaustive Generation
@@ Property / cites work: Isomorph-Free Exhaustive Generation / rank @@
+Normal rank
@@ Property / cites work @@
+A Search Procedure for Hamilton Paths and Circuits
+Normal rank
@@ Property / cites work @@
+Generating Hamiltonian circuits without backtracking from errors
+Normal rank
@@ Property / cites work @@
+Statistical estimates of the&amp;lt;tex&amp;gt;n&amp;lt;/tex&amp;gt;-bit Gray codes by restricted random generation of permutations of 1 to&amp;lt;tex&amp;gt;2^n&amp;lt;/tex&amp;gt;
+Normal rank
@@ Property / cites work @@
+Q4474103
@@ Property / cites work: Q4474103 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Q4230728
@@ Property / cites work: Q4230728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank