Using Graph Grammars To Define Sets Of Digraphs

DOI10.1080/03155986.1979.11731737MaRDI QIDQ3051404zbMATH OpenOpenAlexFDO

Authors 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

acyclic graphsformalism for constructive definitionsgenerating rooted labelled digraphsgraph grammarHamiltonian graphsHasse diagramslattices

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3051404)