The following pages link to (Q5607734):
Displaying 11 items.
- Generating and counting unlabeled \(k\)-path graphs (Q496683) (← links)
- The specification of 2-trees (Q696853) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- Efficient Prüfer-like coding and counting labelled hypertrees (Q1022347) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- Cayley's formula for multidimensional trees (Q1220079) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Enumerating k-trees (Q2546877) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
