On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2012.11.020
@@ Property / DOI: 10.1016/j.dam.2012.11.020 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.11.020
+Normal rank
@@ Property / OpenAlex ID @@
+W1986605895
@@ Property / OpenAlex ID: W1986605895 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of totally balanced matrices
@@ Property / cites work: Characterizations of totally balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Which claw-free graphs are perfectly orderable?
@@ Property / cites work: Which claw-free graphs are perfectly orderable? / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of some perfectly orderable graph classes
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Bipolarizable graphs
@@ Property / cites work: Bipolarizable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing a class of perfectly orderable graphs
+Normal rank
@@ Property / cites work @@
+Q2758336
@@ Property / cites work: Q2758336 / rank @@
+Normal rank
@@ Property / cites work @@
+Some classes of perfectly orderable graphs
@@ Property / cites work: Some classes of perfectly orderable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Totally-Balanced and Greedy Matrices
@@ Property / cites work: Totally-Balanced and Greedy Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Permuting matrices to avoid forbidden submatrices
@@ Property / cites work: Permuting matrices to avoid forbidden submatrices / rank @@
+Normal rank
@@ Property / cites work @@
+Doubly Lexical Orderings of Matrices
@@ Property / cites work: Doubly Lexical Orderings of Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q2758332
@@ Property / cites work: Q2758332 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing perfectly orderable graphs
+Normal rank
@@ Property / cites work @@
+All variations on perfectly orderable graphs
@@ Property / cites work: All variations on perfectly orderable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2012.11.020
@@ Property / DOI: 10.1016/J.DAM.2012.11.020 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2442203