{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:10:51Z","timestamp":1697955051190},"reference-count":11,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Series\u2010parallel graphs, outerplanar graphs, and graphs whose polygon matroids are transversal have been characterized by forbidden subgraphs. Tutte introduced a graph decomposition for nonseparable graphs. The results of this paper relate the existence of the forbidden subgraphs to properties of the decomposition. Algorithmic implications are considered.<\/jats:p>","DOI":"10.1002\/net.3230170109","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T21:50:03Z","timestamp":1178920203000},"page":"105-110","source":"Crossref","is-referenced-by-count":6,"title":["Forbidden subgraphs and graph decomposition"],"prefix":"10.1002","volume":"17","author":[{"given":"Donald K.","family":"Wagner","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/23.1.81"},{"key":"e_1_2_1_3_2","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"Chartrand G.","year":"1967","journal-title":"Ann. Inst. Henri Poincare Sec. B"},{"key":"e_1_2_1_4_2","unstructured":"W. H.Cunningham A combinatorial decomposition theory Thesis University of Waterloo (1973)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1980-057-7"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(65)90125-3"},{"key":"e_1_2_1_7_2","unstructured":"R. C.GeldmacherandP. C.Liu An O(max(m n)) algorithm for finding a subgraph homeomorphic to K4 Proceedings of 11th Southeastern Conference on Combinatorics Graph Theory and Computing.1980 pp.597\u2013609."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1080\/03081088508817642"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.3138\/9781487584863"},{"key":"e_1_2_1_11_2","unstructured":"K\u2010P.Vo Determining Outerplanarity using Segments Ph.D. Thesis UCSD (1981)71\u201378."},{"key":"e_1_2_1_12_2","volume-title":"Matroid Theory","author":"Welsh D. J. A.","year":"1976"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T12:23:08Z","timestamp":1697890988000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170109"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170109","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}