scientific article; zbMATH DE number 3329638
From MaRDI portal
Publication:5607734
zbMath0207.23001MaRDI QIDQ5607734
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Counting and enumerating unlabeled split–indifference graphs ⋮ Generating and counting unlabeled \(k\)-path graphs ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ A coding algorithm for Rényi trees ⋮ The specification of 2-trees ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ Cayley's formula for multidimensional trees ⋮ A clique-difference encoding scheme for labelled \(k\)-path graphs ⋮ Efficient Prüfer-like coding and counting labelled hypertrees ⋮ Enumerating k-trees ⋮ Enumeration of labelled \((k,m)\)-trees ⋮ The Reduced Prüfer Code for Rooted Labelled k-Trees
This page was built for publication:
