Construction of Hamiltonian graphs and bigraphs with prescribed degrees (Q1251235): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(78)90016-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2030482726
@@ Property / OpenAlex ID: W2030482726 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636912
@@ Property / cites work: Q5636912 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences Realizable by Graphs with Hamiltonian Squares
+Normal rank
@@ Property / cites work @@
+Q4168941
@@ Property / cites work: Q4168941 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3287781
@@ Property / cites work: Q3287781 / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on flows in networks
@@ Property / cites work: A theorem on flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3230887
@@ Property / cites work: Q3230887 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for constructing graphs and digraphs with given valences and factors
+Normal rank
@@ Property / cites work @@
+The k-factor conjecture is true
@@ Property / cites work: The k-factor conjecture is true / rank @@
+Normal rank
@@ Property / cites work @@
+On factorable degree sequences
@@ Property / cites work: On factorable degree sequences / rank @@
+Normal rank