Some graphic uses of an even number of odd nodes (Q1296145): Difference between revisions

@@ Property / DOI @@
-.5802/aif.1694
@@ Property / DOI: 10.5802/aif.1694 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2499374790
@@ Property / OpenAlex ID: W2499374790 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q63392983
@@ Property / Wikidata QID: Q63392983 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles and Uniquely Edge Colourable Graphs
+Normal rank
@@ Property / cites work @@
+Properties of a Euler graph
@@ Property / cites work: Properties of a Euler graph / rank @@
+Normal rank
@@ Property / cites work @@
+Parity theorems for paths and cycles in graphs
@@ Property / cites work: Parity theorems for paths and cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parity results on connected f-factors
@@ Property / cites work: Parity results on connected f-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Pairs of Adjacent Hamiltonian Circuits with Small Intersection
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in a graph of degree 4
@@ Property / cites work: Hamiltonian cycles in a graph of degree 4 / rank @@
+Normal rank
@@ Property / cites work @@
+On common edges in optimal solutions to traveling salesman and other optimization problems
+Normal rank
@@ Property / cites work @@
+The adjacency relation on the traveling salesman polytope is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3348434
@@ Property / cites work: Q3348434 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Q4234077
@@ Property / cites work: Q4234077 / rank @@
+Normal rank
@@ Property / DOI @@
+.5802/AIF.1694
@@ Property / DOI: 10.5802/AIF.1694 / rank @@
+Normal rank