Balancing two spanning trees (Q3087621): 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.1002/net.20405
@@ Property / full work available at URL: https://doi.org/10.1002/net.20405 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2096941675
@@ Property / OpenAlex ID: W2096941675 / rank @@
+Normal rank
@@ Property / cites work @@
+Connected (g, f)-factors
@@ Property / cites work: Connected (g, f)-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
+Normal rank
@@ Property / cites work @@
+Q5506265
@@ Property / cites work: Q5506265 / rank @@
+Normal rank
@@ Property / cites work @@
+Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3986938
@@ Property / cites work: Q3986938 / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank