A linear algorithm for the number of degree constrained subforests of a tree (Q1836478): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4052166
@@ Property / cites work: Q4052166 / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
+Normal rank
@@ Property / cites work @@
+Q3487387
@@ Property / cites work: Q3487387 / rank @@
+Normal rank
@@ Property / cites work @@
+On the optional hamiltonian completion problem
@@ Property / cites work: On the optional hamiltonian completion problem / rank @@
+Normal rank
@@ Property / cites work @@
+<i>b</i>-Matchings in Trees
@@ Property / cites work: <i>b</i>-Matchings in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for a core of a tree
@@ Property / cites work: A linear algorithm for a core of a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Path coverings of the vertices of a tree
@@ Property / cites work: Path coverings of the vertices of a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(82)90103-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2082736938
@@ Property / OpenAlex ID: W2082736938 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1836478