Pages that link to "Item:Q1207762"
From MaRDI portal
The following pages link to A coding algorithm for Rényi trees (Q1207762):
Displaying 5 items.
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)
