Indirect counting trees in linear graphs (Q2557701): 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/0016-0032(71)90013-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2089310087
@@ Property / OpenAlex ID: W2089310087 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating formulas for the number of trees in a graph
+Normal rank
@@ Property / cites work @@
+The identification of an incompletely partitioned network
+Normal rank
@@ Property / cites work @@
+Q3248455
@@ Property / cites work: Q3248455 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
+Normal rank
@@ Property / cites work @@
+Q5523467
@@ Property / cites work: Q5523467 / rank @@
+Normal rank