Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228): Difference between revisions

@@ Property / cites work @@
+Splitting digraphs
@@ Property / cites work: Splitting digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding good 2-partitions of digraphs. I. Hereditary properties
+Normal rank
@@ Property / cites work @@
+Finding a subdivision of a digraph
@@ Property / cites work: Finding a subdivision of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+On the problem of finding disjoint cycles and dicycles in a digraph
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint directed and undirected cycles in general digraphs
+Normal rank
@@ Property / cites work @@
+Arc-disjoint spanning sub(di)graphs in digraphs
@@ Property / cites work: Arc-disjoint spanning sub(di)graphs in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning a graph into a few connected subgraphs
+Normal rank
@@ Property / cites work @@
+The circular chromatic number of a digraph
@@ Property / cites work: The circular chromatic number of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Defective coloring revisited
@@ Property / cites work: Defective coloring revisited / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+On spanning galaxies in digraphs
@@ Property / cites work: On spanning galaxies in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connected Feedback Vertex Set in Planar Graphs
@@ Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of graphs with condition on the connectivity and minimum degree
+Normal rank
@@ Property / cites work @@
+Partitions of graphs with high minimum degree or connectivity.
+Normal rank
@@ Property / cites work @@
+Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
+Normal rank
@@ Property / cites work @@
+Splitting a graph into disjoint induced paths or cycles.
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
+Normal rank
@@ Property / cites work @@
+Bipartition of graph under degree constraints
@@ Property / cites work: Bipartition of graph under degree constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273847
@@ Property / cites work: Q4273847 / rank @@
+Normal rank
@@ Property / cites work @@
+FPT algorithms for connected feedback vertex set
@@ Property / cites work: FPT algorithms for connected feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691764
@@ Property / cites work: Q3691764 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for bipartition of biconnected graphs
+Normal rank
@@ Property / cites work @@
+Graph decomposition with constraints on the connectivity and minimum degree
+Normal rank
@@ Property / cites work @@
+Even cycles in directed graphs
@@ Property / cites work: Even cycles in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs into connected parts
@@ Property / cites work: Partitioning graphs into connected parts / rank @@
+Normal rank