Characterizing N+-perfect line graphs (Q2968506): Difference between revisions

@@ Property / cites work @@
+Near-perfect graphs with polyhedral
@@ Property / cites work: Near-perfect graphs with polyhedral / 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 @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Characterizing and bounding the imperfection ratio for some classes of graphs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
+Normal rank
@@ Property / cites work @@
+Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+The stable set problem and the lift-and-project ranks of graphs
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Near-perfect matrices
@@ Property / cites work: Near-perfect matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Applying Lehman's theorems to packing problems
@@ Property / cites work: Applying Lehman's theorems to packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448770
@@ Property / cites work: Q4448770 / rank @@
+Normal rank
@@ Property / cites work @@
+Antiwebs are rank-perfect
@@ Property / cites work: Antiwebs are rank-perfect / rank @@
+Normal rank
@@ Property / cites work @@
+On rank-perfect subclasses of near-bipartite graphs
+Normal rank