Edge intersection graphs of linear 3-uniform hypergraphs (Q5902100): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2007.12.082
@@ Property / DOI: 10.1016/j.disc.2007.12.082 / rank @@
-Normal rank
@@ Property / cites work @@
+Q5570136
@@ Property / cites work: Q5570136 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373683
@@ Property / cites work: Q4373683 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing intersection graphs of linear uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5837982
@@ Property / cites work: Q5837982 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Line hypergraphs
@@ Property / cites work: Line hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On line graphs of linear 3-uniform hypergraphs
@@ Property / cites work: On line graphs of linear 3-uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection graphs of k-uniform linear hypergraphs
+Normal rank
@@ Property / cites work @@
+Intersection Graphs of k-Uniform Hypergraphs
@@ Property / cites work: Intersection Graphs of k-Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient reconstruction of a graph from its line graph in parallel
+Normal rank
@@ Property / cites work @@
+Complexity of representation of graphs by set systems
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2007.12.082
@@ Property / DOI: 10.1016/J.DISC.2007.12.082 / rank @@
+Normal rank