Report - On Context-free Graph Grammars Bruno Courcelle · Graphs described by “forbidden subgraphs or minors” Planar graphs = graphs without K 5 and K 3,3 as “minors” (some notion

Please pass captcha verification before submit form