---
title: "Single pushout graph rewriting"
chunk: 1/1
source: "https://en.wikipedia.org/wiki/Single_pushout_graph_rewriting"
category: "reference"
tags: "science, encyclopedia"
date_saved: "2026-05-05T11:38:55.571765+00:00"
instance: "kb-cron"
---

In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast to the double-pushout approach of graph rewriting.


== References ==


== Further reading ==
Ehrig, H.; R. Heckel; M. Korff; M. Löwe; L. Ribeiro; A. Wagner; A. Corradini (1997). "Chapter 4. Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach". In Grzegorz Rozenberg (ed.). Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific. pp. 247–312. CiteSeerX 10.1.1.72.1644. ISBN 978-981-238-472-0.