Patchworks and metablocks enumeration
From MaRDI portal
Publication:1607027
DOI10.1016/S0020-0190(00)00015-6zbMath1014.68113WikidataQ126843639 ScholiaQ126843639MaRDI QIDQ1607027
Loÿs Thimonier, Vlady Ravelomanana
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Cites Work
- Unnamed Item
- A calculus for the random generation of labelled combinatorial structures
- The enumeration of labeled graphs by number of cutpoints
- The number of labeled dissections of a k-ball
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
- The number of connected sparsely edged graphs. II. Smooth graphs and blocks