@article{Courcelle199829,
Abstract = {We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.},
Author = {Courcelle, B and S{\'e}nizergues, G},
File = {The obstructions of a minor-closed set of graphs defined by a context-free grammar - Courcelle, Sénizergues (0) (0) - a - a - c.pdf},
ISSN = {0012-365X},
Journal = {Discrete Mathematics},
Number = {1--3},
Pages = {29 - 51},
Title = {The obstructions of a minor-closed set of graphs defined by a context-free grammar},
URL = {http://www.sciencedirect.com/science/article/pii/S0012365X97830798},
Volume = {182},
Year = {1998},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0012365X97830798},
bdsk-url-2 = {http://dx.doi.org/10.1016/S0012-365X(97)83079-8},
date-added = {2014-06-24 11:24:00 +0000},
date-modified = {2014-06-24 11:24:00 +0000},
doi = {10.1016/S0012-365X(97)83079-8}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A