A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars

DOI10.1007/S002240000115zbMath0916.68110OpenAlexW2065255929MaRDI QIDQ1281933

Frank Drewes

Publication date: 22 March 1999

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000115

zbMATH Keywords

hyperedge-replacement graph grammarslanguages of hypertrees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

GETGRATS ⋮ Tree-based picture generation

This page was built for publication: A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars