Hypermap rewriting: A combinatorial approach

DOI10.1016/0304-3975(91)90183-3zbMath0741.68063OpenAlexW2010730331MaRDI QIDQ1178702

Eric Sopena

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90183-3

zbMATH Keywords

decidabilitygraph grammarcombinatorial hypermapshyperedge rewriting

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
• 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
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Graph-encoded maps
• Decision problems for node label controlled graph grammars
• Combinatorial maps
• Hypermaps versus bipartite maps
• Equipartite colorings in graphs and hypergraphs
• On sequential and parallel node-rewriting graph grammars
• On sequential and parallel node-rewriting graph grammars, II
• Graph expressions and graph rewritings
• Combinatorial Oriented Maps
• Theory of Maps on Orientable Surfaces
• Node rewriting in graphs and hypergraphs: A categorical framework

This page was built for publication: Hypermap rewriting: A combinatorial approach