Characterization problems for graphs, pa
β
William T. Trotter Jr.; John I. Moore Jr.
π
Article
π
1976
π
Elsevier Science
π
English
β 909 KB
A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p