Line perfect graphs (Q4141848): Difference between revisions

@@ Property / author @@
-Leslie E. jun. Trotter
@@ Property / author: Leslie E. jun. Trotter / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56388864
@@ Property / Wikidata QID: Q56388864 / rank @@
+Normal rank
@@ Property / author @@
+Leslie E. jun. Trotter
@@ Property / author: Leslie E. jun. Trotter / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Establishing the matching polytope
@@ Property / cites work: Establishing the matching polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Q5603088
@@ Property / cites work: Q5603088 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / 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 @@
+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 @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-blocking polyhedra
@@ Property / cites work: Anti-blocking polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q5685113
@@ Property / cites work: Q5685113 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5799732
@@ Property / cites work: Q5799732 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of perfect graphs
@@ Property / cites work: A characterization of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
+Normal rank