Restricted cycle factors and arc-decompositions of digraphs (Q2354716): Difference between revisions

@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / 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 @@
+Q4796188
@@ Property / cites work: Q4796188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On avoiding some families of arrays
@@ Property / cites work: On avoiding some families of arrays / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of the edge precoloring extension problem on bipartite graphs
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Finding maximum square-free 2-matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q5530472
@@ Property / cites work: Q5530472 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273847
@@ Property / cites work: Q4273847 / rank @@
+Normal rank