Graph-theoretic properties compatible with graph derivations

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

Authors: Annegret Habel 

Publication date: 28 February 2024

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

Recommendations

• scientific article; zbMATH DE number 4087049
• Metatheorems for decision problems on hyperedge replacement graph languages
• scientific article; zbMATH DE number 219278
• Publication:3486868
• scientific article; zbMATH DE number 965

Mathematics Subject Classification ID

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

Cites Work

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

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

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