Graph-theoretic properties compatible with graph derivations

DOI10.1007/3-540-50728-0_33MaRDI QIDQ6203538

Annegret Habel

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretic closure properties of the family of boundary NLC graph languages
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Characteristics of graph languages generated by edge replacement
• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity

This page was built for publication: Graph-theoretic properties compatible with graph derivations