{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:14:34Z","timestamp":1758824074486},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0020-0190(02)00268-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T20:29:59Z","timestamp":1034281799000},"page":"141-145","source":"Crossref","is-referenced-by-count":4,"title":["Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application"],"prefix":"10.1016","volume":"84","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Shiqing","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00268-5_BIB001","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(85)90222-1","article-title":"An approach to the subgraph homeomorphism problem","volume":"38","author":"Asano","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB002","series-title":"Graph Theory with Applications","author":"Bondy","year":"1980"},{"key":"10.1016\/S0020-0190(02)00268-5_BIB003","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(94)00112-V","article-title":"The maximal f-dependent set problem for planar graphs is in NC","volume":"143","author":"Chen","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB004","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/jagm.1997.0894","article-title":"Efficient approximation schemes for maximization problems on K3,3-free or K5-free graphs","volume":"26","author":"Chen","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00268-5_BIB005","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0304-3975(97)00254-5","article-title":"Efficient algorithms for acyclic colorings of graphs","volume":"230","author":"Chen","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB006","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/PL00009178","article-title":"Parallel algorithms for maximal acyclic sets","volume":"19","author":"Chen","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00268-5_BIB007","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01848093","article-title":"On the edge number of graphs with Hadwiger number 4 and 5","volume":"13","author":"Gy\u00f6ri","year":"1982","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB008","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1090\/S0002-9904-1943-08065-2","article-title":"A note on primitive skew curves","volume":"49","author":"Hall","year":"1943","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB009","series-title":"Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms","first-page":"345","article-title":"Sequential and parallel algorithms to find a K5 minor","author":"K\u00e9zdy","year":"1992"},{"key":"10.1016\/S0020-0190(02)00268-5_BIB010","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(90)90031-C","article-title":"Extending planar graph algorithms to K3,3-free graphs","volume":"84","author":"Khuller","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB011","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","article-title":"NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems","volume":"80","author":"Vazirani","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(02)00268-5_BIB012","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1112\/jlms\/s2-3.4.661","article-title":"A quick proof of Wagner's equivalence theorem","volume":"2","author":"Young","year":"1971","journal-title":"J. London Math. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002685?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002685?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:50:31Z","timestamp":1555181431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0020019002002685"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00268-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}