Pages that link to "Item:Q3439323"
From MaRDI portal
The following pages link to The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323):
Displaying 7 items.
- 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)
- Colored Prüfer codes for \(k\)-edge colored trees (Q1773178) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)
- On the number of labeled \(k\)-arch graphs (Q5387517) (← links)