Edge Partition of Toroidal Graphs into Forests in Linear Time (Q3439375): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2005.06.065
+Normal rank
@@ Property / OpenAlex ID @@
+W2079215340
@@ Property / OpenAlex ID: W2079215340 / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence ratio of a graph
@@ Property / cites work: On the independence ratio of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding graphs in the torus in linear time
@@ Property / cites work: Embedding graphs in the torus in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds of the number of disjoint spanning trees
@@ Property / cites work: Bounds of the number of disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Five-coloring maps on surfaces
@@ Property / cites work: Five-coloring maps on surfaces / rank @@
+Normal rank