Pages that link to "Item:Q2521783"
From MaRDI portal
The following pages link to On trees of a graph and their generation (Q2521783):
Displayed 10 items.
- On the complexity of the robust spanning tree problem with interval data (Q1433657) (← links)
- Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph (Q2062131) (← links)
- Generating formulas for the number of trees in a graph (Q2521176) (← links)
- On two-tree transformations and the separation of two-tree sets (Q2524207) (← links)
- Enumeration of spanning trees containing given subgraphs (Q2550033) (← links)
- On the graph for which there is a tree as the inverse interchange graph of a local graph (Q2553442) (← links)
- A pivot Gray code listing for the spanning trees of the fan graph (Q2695273) (← links)
- Enumeration of spanning trees containing given subtrees (Q4050635) (← links)
- On Connectedness and Trees of an N-graph (Q5593803) (← links)
- Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract) (Q6057353) (← links)