Strictly chordal graphs are leaf powers (Q866539): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2005.06.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2049045223
@@ Property / OpenAlex ID: W2049045223 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of join dependencies
@@ Property / cites work: On the complexity of join dependencies / rank @@
+Normal rank
@@ Property / cites work @@
+Tree Powers
@@ Property / cites work: Tree Powers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472526
@@ Property / cites work: Q4472526 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Square Roots of Graphs
@@ Property / cites work: Algorithms for Square Roots of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing roots of graphs is hard
@@ Property / cites work: Computing roots of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721973
@@ Property / cites work: Q2721973 / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Powers for Leaf-Labeled Trees
@@ Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Recent Advances in Constraints
@@ Property / cites work: Recent Advances in Constraints / rank @@
+Normal rank