Graph property recognition machines

DOI10.1007/BF01691465MaRDI QIDQ5616161zbMATH OpenOpenAlexFDO

Authors Herbert S. Shank

Publication date 1971

Published in Mathematical Systems Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of graph theory to circuits and networks (94C15)

Cites work

• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)

Cited in

(8)

• Balanced vertex weightings and arborescences
• Sequential and cellular graph automata
• Toward a mathematical theory of graph-generative systems and its applications
• Generalized bicycles
• Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
• Web grammars and several graphs
• Bicycles and Spanning Trees
• A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean

This page was built for publication: Graph property recognition machines

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