Classes of intersection digraphs with good algorithmic properties (Q6201028): Difference between revisions

@@ Property / cites work @@
+Out‐colourings of digraphs
@@ Property / cites work: Out‐colourings of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5442546
@@ Property / cites work: Q5442546 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained 2-partitions of semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Finding good 2-partitions of digraphs. II. Enumerable properties
+Normal rank
@@ Property / cites work @@
+Classes of Directed Graphs
@@ Property / cites work: Classes of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Out-degree reducing partitions of digraphs
@@ Property / cites work: Out-degree reducing partitions of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite spanning sub(di)graphs induced by 2‐partitions
+Normal rank
@@ Property / cites work @@
+Efficient domination of the orientations of a graph
+Normal rank
@@ Property / cites work @@
+Connection digraphs and second-order line digraphs
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving problems on generalized convex graphs via mim-width
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Maximum \(k\)-regular induced subgraphs
@@ Property / cites work: Maximum \(k\)-regular induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent domination in directed graphs
@@ Property / cites work: Independent domination in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463344
@@ Property / cites work: Q5463344 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
+Normal rank
@@ Property / cites work @@
+On the tractability of optimization problems on \(H\)-graphs
+Normal rank
@@ Property / cites work @@
+On the kernel and related problems in interval digraphs
+Normal rank
@@ Property / cites work @@
+Dominating Set and Converse Dominating Set of a Directed Graph
+Normal rank
@@ Property / cites work @@
+A recognition algorithm for the intersection graphs of directed paths in directed trees
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear MIM-width of trees
@@ Property / cites work: Linear MIM-width of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Mim-width. III. Graph powers and generalized distance domination problems
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+A width parameter useful for chordal and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+The rank-width of edge-coloured graphs
@@ Property / cites work: The rank-width of edge-coloured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Directed Grid Theorem
@@ Property / cites work: The Directed Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the mim-width of some graph classes
+Normal rank
@@ Property / cites work @@
+Recognizing interval digraphs and interval bigraphs in polynomial time
+Normal rank
@@ Property / cites work @@
+On the \(k\)-domination number of digraphs
@@ Property / cites work: On the \(k\)-domination number of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Rank‐width is less than or equal to branch‐width
+Normal rank
@@ Property / cites work @@
+Algorithms for interval catch digraphs
@@ Property / cites work: Algorithms for interval catch digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new generalization of kernels in digraphs
@@ Property / cites work: A new generalization of kernels in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Efficient total domination in digraphs
@@ Property / cites work: Efficient total domination in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circular‐arc digraphs: A characterization
@@ Property / cites work: Circular‐arc digraphs: A characterization / 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 @@
+Q2816137
@@ Property / cites work: Q2816137 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of oriented graphs
@@ Property / cites work: The chromatic number of oriented graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms and colourings of oriented graphs: an updated survey
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Q5844986
@@ Property / cites work: Q5844986 / rank @@
+Normal rank