{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T01:55:13Z","timestamp":1675216513686},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,3]],"date-time":"2010-04-03T00:00:00Z","timestamp":1270252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s00373-010-0922-0","type":"journal-article","created":{"date-parts":[[2010,4,2]],"date-time":"2010-04-02T09:26:15Z","timestamp":1270200375000},"page":"301-313","source":"Crossref","is-referenced-by-count":9,"title":["A Min\u2013Max Property of Chordal Bipartite Graphs with Applications"],"prefix":"10.1007","volume":"26","author":[{"given":"Atif","family":"Abueida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur H.","family":"Busch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,3]]},"reference":[{"key":"922_CR1","unstructured":"Brandst\u00e4dt, A., Ho\u00e1ng, C.T.: Maximum induced matching for chordal graphs in linear time, To appear in Algorithmica"},{"key":"922_CR2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.tcs.2007.04.006","volume":"381","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt A., Eschen E.M., Sritharan R.: The induced matching and chain subgraph cover problems for convex bipartite graphs. Theor. Comput. Sci. 381, 260\u2013265 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"922_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia, 1999","DOI":"10.1137\/1.9780898719796"},{"key":"922_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron K.: Induced matchings. Discret. Appl. Math. 24, 97\u2013102 (1989)","journal-title":"Discret. Appl. Math."},{"key":"922_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2003.05.001","volume":"278","author":"K. Cameron","year":"2004","unstructured":"Cameron K.: Induced matchings in intersection graphs. Discret. Math. 278, 1\u20139 (2004)","journal-title":"Discret. Math."},{"key":"922_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K. Cameron","year":"2003","unstructured":"Cameron K., Sritharan R., Tang Y.: Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266, 133\u2013142 (2003)","journal-title":"Discret. Math."},{"key":"922_CR7","first-page":"67","volume":"132","author":"C. Jou-Ming","year":"2004","unstructured":"Jou-Ming C.: Induced matchings in asteroidal triple-free graphs, stability in graphs, and related topics. Discret. Appl. Math. 132, 67\u201378 (2004)","journal-title":"Discret. Appl. Math."},{"key":"922_CR8","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/0605055","volume":"5","author":"M.B. Cozzens","year":"1984","unstructured":"Cozzens M.B., Leibowitz R.: Threshold dimension of graphs. SIAM J. Algebraic Discret. Methods 5, 579\u2013595 (1984)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"922_CR9","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Dushnik B., Miller E.W.: Partially ordered sets. Am. J. Math. 63, 600\u2013610 (1941)","journal-title":"Am. J. Math."},{"key":"922_CR10","first-page":"239","volume":"89","author":"G. Fricke","year":"1992","unstructured":"Fricke G., Laskar R.: Strong matchings on trees. Congr. Numerantium 89, 239\u2013243 (1992)","journal-title":"Congr. Numerantium"},{"key":"922_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","volume":"44","author":"M.C. Golumbic","year":"1993","unstructured":"Golumbic M.C., Laskar R.C.: Irredundancy in circular arc graphs. Discret. Appl. Math. 44, 79\u201389 (1993)","journal-title":"Discret. Appl. Math."},{"key":"922_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic M.C., Lewenstein M.: New results on induced matchings. Discret. Appl. Math. 101, 157\u2013165 (2000)","journal-title":"Discret. Appl. Math."},{"key":"922_CR13","first-page":"739","volume":"23","author":"F. Harary","year":"1982","unstructured":"Harary F., Kabell J.A., McMorris F.R.: Bipartite intersection graphs. Comm. Math. Univ. Carolinae 23, 739\u2013745 (1982)","journal-title":"Comm. Math. Univ. Carolinae"},{"key":"922_CR14","doi-asserted-by":"crossref","unstructured":"Hayward, R.B., Ho\u00e0ng, C.T., Maffray, F.: Optimizing weakly triangulated graphs, Graphs Combinatorics 5, 339\u2013349 (1989); erratum in 6, 33\u201335 (1990)","DOI":"10.1007\/BF01788689"},{"key":"922_CR15","unstructured":"Hayward, R.B., Spinrad, J.P., Sritharan, R.: Weakly chordal graph algorithms via handles. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 42\u201349 (2000)"},{"key":"922_CR16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P. Hell","year":"2004","unstructured":"Hell P., Huang J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46, 313\u2013327 (2004)","journal-title":"J. Graph Theory"},{"key":"922_CR17","unstructured":"Kimble, R.: Extremal problems in dimension theory for partially ordered sets, Ph. D. thesis, Massachusetts Institute of Technology, Cambridge (1973)"},{"key":"922_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jagm.1994.1034","volume":"17","author":"T. Ma","year":"1994","unstructured":"Ma T., Spinrad J.P.: On the 2-chain subgraph cover and related problems. J. Algorithms 17, 251\u2013268 (1994)","journal-title":"J. Algorithms"},{"key":"922_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0166-218X(97)00027-9","volume":"78","author":"H. M\u00fcller","year":"1997","unstructured":"M\u00fcller H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Dis. Appl. Math. 78, 189\u2013205 (1997)","journal-title":"Dis. Appl. Math."},{"key":"922_CR20","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/jgt.3190130508","volume":"13","author":"M. Sen","year":"1989","unstructured":"Sen M., Das S., Roy A.B., West D.B.: Interval digraphs: an analogue of interval graphs. J. Graph Theory 13, 581\u2013592 (1989)","journal-title":"J. Graph Theory"},{"key":"922_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(76)90095-9","volume":"16","author":"W.T. Trotter","year":"1976","unstructured":"Trotter W.T., Bogart K.P.: On the complexity of posets. Discret. Math. 16, 71\u201382 (1976)","journal-title":"Discret. Math."},{"key":"922_CR22","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ (1996)"},{"key":"922_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0012-365X(97)81840-7","volume":"178","author":"D.B. West","year":"1998","unstructured":"West D.B.: Short proofs for interval digraphs. Discret. Math. 178, 287\u2013292 (1998)","journal-title":"Discret. Math."},{"key":"922_CR24","first-page":"310","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discret. Methods 10, 310\u2013327 (1981)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"922_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0304-3975(97)00036-4","volume":"205","author":"C. Yu","year":"1998","unstructured":"Yu C., Chen G., Ma T.: On the complexity of the k-chain subgraph cover problem. Theor. Comput. Sci. 205, 85\u201398 (1998)","journal-title":"Theor. Comput. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0922-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0922-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0922-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0922-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,3]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["922"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0922-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,3]]}}}