Graph property recognition machines

DOI10.1007/BF01691465zbMath0214.02207OpenAlexW2056155661MaRDI QIDQ5616161

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)

Related Items (8)

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

Cites Work

• Unnamed Item
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH

This page was built for publication: Graph property recognition machines