Strict chordal and strict split digraphs (Q516787): Difference between revisions

@@ Property / cites work @@
+Perfect Digraphs
@@ Property / cites work: Perfect Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688415
@@ Property / cites work: Q3688415 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The LBFS Structure and Recognition of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3971999
@@ Property / cites work: Q3971999 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval digraphs: An analogue of interval graphs
@@ Property / cites work: Interval digraphs: An analogue of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+Q3495376
@@ Property / cites work: Q3495376 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4032986
@@ Property / cites work: Q4032986 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward Characterization of Perfect Elimination Digraphs
+Normal rank
@@ Property / cites work @@
+Q5503435
@@ Property / cites work: Q5503435 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning chordal graphs into independent sets and cliques
+Normal rank
@@ Property / cites work @@
+An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q4471290
@@ Property / cites work: Q4471290 / rank @@
+Normal rank
@@ Property / cites work @@
+Split digraphs
@@ Property / cites work: Split digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+Subpath acyclic digraphs
@@ Property / cites work: Subpath acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal digraphs
@@ Property / cites work: Chordal digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing interval digraphs and interval bigraphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4774066
@@ Property / cites work: Q4774066 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank