An algorithm for fraternal orientation of graphs (Q1197981): Difference between revisions

@@ Property / cites work @@
+\(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
+Normal rank
@@ Property / cites work @@
+Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Intersection graphs of paths in a tree
@@ Property / cites work: Intersection graphs of paths in a tree / 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 @@
+A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
+Normal rank