The following pages link to Dietmar Cieslik (Q587985):
Displayed 50 items.
- Item:Q587985 (redirect page) (← links)
- A spanning tree of the \(2^ m\)-dimensional hypercube with maximum number of degree-preserving vertices (Q686181) (← links)
- Similarity and asymmetrization of trees (Q686304) (← links)
- New families of graceful banana trees (Q1126331) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Steiner tree problems (Q1187352) (← links)
- The Steiner minimal network for convex configurations (Q1207800) (← links)
- Fourier calculus on evolutionary trees (Q1261858) (← links)
- Maximal trees with bounded maximum degree in a graph (Q1268112) (← links)
- A bijective census of nonseparable planar maps (Q1268599) (← links)
- Vertex degrees of Steiner minimal trees in \(\ell_p^d\) and other smooth Minkowski spaces (Q1289246) (← links)
- Spanning trees of countable graphs omitting sets of dominated ends (Q1297479) (← links)
- The Steiner ratio of \({\mathcal L}_{2k}^d\) (Q1302158) (← links)
- Steiner systems and Stein quasigroups (Q1320083) (← links)
- The joint sum of graceful trees (Q1324364) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs (Q1333343) (← links)
- The Steiner ratio (Q1347366) (← links)
- A Strahler bijection between Dyck paths and planar trees (Q1348155) (← links)
- On graphs which contain each tree of given size (Q1356784) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant (Q1365199) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
- On exponential trees (Q1378292) (← links)
- Steiner minimal trees (Q1384593) (← links)
- Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (Q1400780) (← links)
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781) (← links)
- Melzak algorithm for phylogenetic spaces (Q1405934) (← links)
- The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
- Connectivity calculus (Q1431949) (← links)
- Degree-preserving spanning trees in small-degree graphs (Q1579547) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- Shortest connectivity. An introduction with applications in phylogeny. (Q1762565) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- Factorizations of \(K_{m,n}\) into spanning trees (Q1808713) (← links)
- \(k\)-Steiner-minimal-trees in metric spaces (Q1808781) (← links)
- Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method (Q1842656) (← links)
- The Steiner ratio of several discrete metric spaces (Q1861256) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- A monotone iterative procedure to approximate trees of minimal length in metric spaces. (Q1875305) (← links)
- The Steiner ratio for manifolds. (Q1889544) (← links)
- Every tree contains a large induced subgraph with all degrees odd (Q1893180) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- Low-degree minimum spanning trees (Q1895968) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- On \(n\)th order degree regular trees (Q1901617) (← links)
- A combinatorial construction for twin trees (Q1911839) (← links)
- On Matula numbers (Q1916104) (← links)