Finding a chain graph in a bipartite permutation graph (Q284350): Difference between revisions

@@ 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.ipl.2016.04.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2339922093
@@ Property / OpenAlex ID: W2339922093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028103
@@ Property / cites work: Q4028103 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5503435
@@ Property / cites work: Q5503435 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
+Normal rank
@@ Property / cites work @@
+Subgraph isomorphism in graph classes
@@ Property / cites work: Subgraph isomorphism in graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
+Normal rank
@@ Property / cites work @@
+Q2965515
@@ Property / cites work: Q2965515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390698
@@ Property / cites work: Q4390698 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:284350