Arc-disjoint paths and trees in 2-regular digraphs (Q2444565): Difference between revisions

@@ Property / author @@
-Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / rank @@
-Normal rank
@@ Property / author @@
+Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2044338318
@@ Property / OpenAlex ID: W2044338318 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4705
@@ Property / arXiv ID: 1203.4705 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint in- and out-branchings in tournaments and related path problems
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Disjoint directed and undirected paths and cycles in digraphs
+Normal rank
@@ Property / cites work @@
+On the problem of finding disjoint cycles and dicycles in a digraph
+Normal rank
@@ Property / cites work @@
+Small degree out‐branchings
@@ Property / cites work: Small degree out‐branchings / rank @@
+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 @@
+A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
+Normal rank
@@ Property / cites work @@
+Q5593828
@@ Property / cites work: Q5593828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744300
@@ Property / cites work: Q4744300 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Q3691763
@@ Property / cites work: Q3691763 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank