The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090): Difference between revisions

@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588432
@@ Property / cites work: Q5588432 / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices, interval graphs and seriation in archeology
+Normal rank
@@ Property / cites work @@
+Construction of Ternary<i>H</i><sub><i>v</i></sub>-groups and Ternary<i>P</i>-hyperoperations
+Normal rank
@@ Property / cites work @@
+Matrix characterizations of circular-arc graphs
@@ Property / cites work: Matrix characterizations of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection representations of graphs by arcs
@@ Property / cites work: Intersection representations of graphs by arcs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank