Combinatorial optimization with 2-joins (Q765197): Difference between revisions

@@ Property / cites work @@
+Detecting 2-joins faster
@@ Property / cites work: Detecting 2-joins faster / rank @@
+Normal rank
@@ Property / cites work @@
+Berge trigraphs
@@ Property / cites work: Berge trigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Star-cutsets and perfect graphs
@@ Property / cites work: Star-cutsets and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bull-free Berge graphs are perfect
@@ Property / cites work: Bull-free Berge graphs are perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced \(0,\pm 1\) matrices. I: Decomposition
@@ Property / cites work: Balanced \(0,\pm 1\) matrices. I: Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part II: Recognition algorithm
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part I: Decomposition theorem
+Normal rank
@@ Property / cites work @@
+Decomposition of balanced matrices
@@ Property / cites work: Decomposition of balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Square-free perfect graphs.
@@ Property / cites work: Square-free perfect graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
+Normal rank
@@ Property / cites work @@
+Compositions for perfect graphs
@@ Property / cites work: Compositions for perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated neighborhoods in even-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Optimizing Bull-Free Perfect Graphs
@@ Property / cites work: Optimizing Bull-Free Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
+Normal rank
@@ Property / cites work @@
+Q4344207
@@ Property / cites work: Q4344207 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Graph minor theory
@@ Property / cites work: Graph minor theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Decomposition of regular matroids
@@ Property / cites work: Decomposition of regular matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing Berge graphs and detecting balanced skew partitions
+Normal rank
@@ Property / cites work @@
+A structure theorem for graphs with no cycle with a unique chord and its consequences
+Normal rank
@@ Property / cites work @@
+Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
+Normal rank