Bounded degree acyclic decompositions of digraphs. (Q1426101): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2003.08.004
@@ Property / DOI: 10.1016/j.jctb.2003.08.004 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2003.08.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2002893084
@@ Property / OpenAlex ID: W2002893084 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced vertex-orderings of graphs
@@ Property / cites work: Balanced vertex-orderings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Area-efficient static and incremental graph drawings
+Normal rank
@@ Property / cites work @@
+Q3035333
@@ Property / cites work: Q3035333 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3877699
@@ Property / cites work: Q3877699 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear arboricity of digraphs
@@ Property / cites work: Linear arboricity of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal three-dimensional orthogonal graph drawing in the general position model.
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2003.08.004
@@ Property / DOI: 10.1016/J.JCTB.2003.08.004 / rank @@
+Normal rank