Parikh word representability of bipartite permutation graphs (Q2185746): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2019.12.005
@@ Property / DOI: 10.1016/j.dam.2019.12.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2997844190
@@ Property / OpenAlex ID: W2997844190 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10251
@@ Property / arXiv ID: 1812.10251 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126526660
@@ Property / Wikidata QID: Q126526660 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of word representable graphs
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Interval \(k\)-graphs and orders
@@ Property / cites work: Interval \(k\)-graphs and orders / rank @@
+Normal rank
@@ Property / cites work @@
+Q2995145
@@ Property / cites work: Q2995145 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is the intersection graph of segments in the plane
+Normal rank
@@ Property / cites work @@
+Statistical problems involving permutations with restricted positions
+Normal rank
@@ Property / cites work @@
+On the Switch Markov Chain for Perfect Matchings
@@ Property / cites work: On the Switch Markov Chain for Perfect Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Interval bigraphs and circular arc graphs
@@ Property / cites work: Interval bigraphs and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Words and graphs
@@ Property / cites work: Words and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sharpening of the Parikh mapping
@@ Property / cites work: A sharpening of the Parikh mapping / rank @@
+Normal rank
@@ Property / cites work @@
+Topics in Intersection Graph Theory
@@ Property / cites work: Topics in Intersection Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On Context-Free Languages
@@ Property / cites work: On Context-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary matrix equivalence and core transformation graphs for Parikh matrices
+Normal rank
@@ Property / cites work @@
+Characterizing intersection classes of graphs
@@ Property / cites work: Characterizing intersection classes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Core Words and the Parikh Matrix Mapping
@@ Property / cites work: On Core Words and the Parikh Matrix Mapping / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture about Parikh matrices
@@ Property / cites work: On a conjecture about Parikh matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
+Normal rank
@@ Property / cites work @@
+Order of weak \(M\)-relation and Parikh matrices
@@ Property / cites work: Order of weak \(M\)-relation and Parikh matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2019.12.005
@@ Property / DOI: 10.1016/J.DAM.2019.12.005 / rank @@
+Normal rank