Subspace intersection graphs (Q712273): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2010.06.042
@@ Property / DOI: 10.1016/j.disc.2010.06.042 / 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.disc.2010.06.042
+Normal rank
@@ Property / OpenAlex ID @@
+W2065530191
@@ Property / OpenAlex ID: W2065530191 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128962
@@ Property / cites work: Q3128962 / rank @@
+Normal rank
@@ Property / cites work @@
+Research Problems in Discrete Geometry
@@ Property / cites work: Research Problems in Discrete Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is the intersection graph of segments in the plane
+Normal rank
@@ Property / cites work @@
+Triangle-Free Planar Graphs and Segment Intersection Graphs
+Normal rank
@@ Property / cites work @@
+On grid intersection graphs
@@ Property / cites work: On grid intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial approach to complexity
@@ Property / cites work: A combinatorial approach to complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of matrix methods to the theory of lower bounds in computational complexity
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2010.06.042
@@ Property / DOI: 10.1016/J.DISC.2010.06.042 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:712273