Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings of a graph
@@ Property / cites work: Perfect matchings of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A matching problem with side conditions
@@ Property / cites work: A matching problem with side conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3698661
@@ Property / cites work: Q3698661 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q4405192
@@ Property / cites work: Q4405192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4080661
@@ Property / cites work: Q4080661 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum node covers and 2-bicritical graphs
@@ Property / cites work: Minimum node covers and 2-bicritical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4078069
@@ Property / cites work: Q4078069 / rank @@
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Factors of Graphs
@@ Property / cites work: The Factors of Graphs / rank @@
+Normal rank