Using Graph Grammars To Define Sets Of Digraphs

DOI10.1080/03155986.1979.11731737zbMath0415.68043OpenAlexW2398762320MaRDI QIDQ3051404

Antonio L. Furtado, John Mylopoulos

Publication date: 1979

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1979.11731737

zbMATH Keywords

latticesgraph grammarHamiltonian graphsacyclic graphsHasse diagramsformalism for constructive definitionsgenerating rooted labelled digraphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Toward a mathematical theory of graph-generative systems and its applications

This page was built for publication: Using Graph Grammars To Define Sets Of Digraphs