{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T15:38:23Z","timestamp":1715787503468},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00098-0","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:48:19Z","timestamp":1054075699000},"page":"87-96","source":"Crossref","is-referenced-by-count":3,"title":["Interval numbers of powers of block graphs"],"prefix":"10.1016","volume":"275","author":[{"given":"Mingjang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00098-0_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(86)90002-8","article-title":"On an extremal problem concerning the interval number of a graph","volume":"14","author":"Andreae","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/jgt.3190110303","article-title":"On the interval number of a triangulated graph","volume":"14","author":"Andreae","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<153::AID-JGT5>3.0.CO;2-P","article-title":"A sharp edge bound on the interval number of a graph","volume":"32","author":"Balogh","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB4","unstructured":"Y.W. Chang, Graph representations using stars, trees, intervals and boxes, Ph.D. Thesis, Department of Mathematics, University of Illinois at Urbana-Champaign, 1995."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0166-218X(93)90232-D","article-title":"Subtree and substar intersection numbers","volume":"44","author":"Chang","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB6","unstructured":"M.J. Chen, Interval numbers and related topics, Ph.D. Thesis, Department of Applied Mathematics, National Chiao Tung University, Hsinch, Taiwan, 1999."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(85)90041-X","article-title":"A note on interval number of a graph","volume":"55","author":"Erdo&#x030B;s","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(79)90183-3","article-title":"Extremal values of the interval number of a graph, II","volume":"28","author":"Griggs","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0601001","article-title":"Extremal values of the interval of a graph","volume":"1","author":"Griggs","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB10","unstructured":"A. Gy\u00e1rf\u00e1s, D. West, Multitrack interval graphs, Proceedings of the 26th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1995; Congr. Numer. 109 (1995) 109\u2013116."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB11","first-page":"113","article-title":"A characterization of block-graphs","volume":"1","author":"Harary","year":"1963","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB12","series-title":"The Theory and Applications of Graphs","first-page":"391","article-title":"A bound on the interval number of a complete multipartite graph","author":"Hopkins","year":"1981"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(84)90099-4","article-title":"The interval number of a complete multipartite graph","volume":"8","author":"Hopkins","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB14","unstructured":"M.S. Jacobson, F.R. McMorris, H.M. Mulder, An introduction to tolerance intersection graphs, in: Y. Alavi, et al. (Eds.), Graph Theory, Combinatorics, and Applications, Vol. 2, Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs at Western Michigan University, 1988, Wiley, New York, 1991, pp. 705\u2013723."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB15","unstructured":"A.V. Kostochka, D.B. West, Every outerplanar graph is the union of two interval graphs, Proceedings of the 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1999; Congr. Numer. 139 (1999) 5\u20138."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB16","first-page":"45","article-title":"Multidimensional interval graphs","volume":"102","author":"Kumar","year":"1994","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90106-3","article-title":"Some results about the interval number of a graph","volume":"6","author":"Maas","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-0427(84)90070-0","article-title":"A lower bound for the interval number of a graph","volume":"10","author":"Maas","year":"1984","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(91)90245-D","article-title":"An optimal greedy heuristic to color interval graphs","volume":"37","author":"Olariu","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB21","first-page":"125","article-title":"Remarks on the interval number of graphs","volume":"12","author":"Pluh\u00e1r","year":"1995","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems on interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(85)90048-2","article-title":"Irrepresentability by multiple intersection, why the interval number is unbounded","volume":"55","author":"Scheinerman","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(87)90157-9","article-title":"Irredundancy in multiple interval representations","volume":"63","author":"Scheinerman","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/jgt.3190110317","article-title":"The maximum interval number of graphs with given genus","volume":"11","author":"Scheinerman","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB26","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/jgt.3190120303","article-title":"On the interval number of a chordal graph","volume":"12","author":"Scheinerman","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB27","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0095-8956(83)90050-3","article-title":"The interval number of a planar graph","volume":"35","author":"Scheinerman","year":"1983","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB28","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/jgt.3190110318","article-title":"An improved edge bound on the interval number of a graph","volume":"11","author":"Spinrad","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB29","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190030302","article-title":"On double and multiple interval graphs","volume":"3","author":"Trotter","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00098-0_BIB30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(89)90276-8","article-title":"A short proof of the degree bound for interval number","volume":"73","author":"West","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00098-0_BIB31","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(84)90127-6","article-title":"Recognizing graphs with fixed interval number is NP-complete","volume":"8","author":"West","year":"1984","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000980?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000980?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:50:17Z","timestamp":1553158217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03000980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03000980"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00098-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}