{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:33Z","timestamp":1746331353894,"version":"3.40.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1157105"],"award-info":[{"award-number":["1157105"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02901-0","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T20:23:41Z","timestamp":1741897421000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Veto Interval Graphs and Variations"],"prefix":"10.1007","volume":"41","author":[{"given":"Breeann","family":"Flesch","sequence":"first","affiliation":[]},{"given":"Jessica","family":"Kawana","sequence":"additional","affiliation":[]},{"given":"Joshua D.","family":"Laison","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Lapides","sequence":"additional","affiliation":[]},{"given":"Stephanie","family":"Partlow","sequence":"additional","affiliation":[]},{"given":"Gregory J.","family":"Puleo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"issue":"1\u20133","key":"2901_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(98)00310-0","volume":"201","author":"Kenneth P Bogart","year":"1999","unstructured":"Bogart, Kenneth P., West, Douglas B.: A short proof that \u201cproper = unit\u2019\u2019. Discrete Math. 201(1\u20133), 21\u201323 (1999)","journal-title":"Discrete Math."},{"key":"2901_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"JCh Boland","year":"1962","unstructured":"Boland, JCh., Lekkerkerker, C.G.: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51, 45\u201364 (1962)","journal-title":"Fund. Math."},{"issue":"1\u20132","key":"2901_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.dam.2012.07.018","volume":"161","author":"Gunnar Brinkmann","year":"2013","unstructured":"Brinkmann, Gunnar, Coolsaet, Kris, Goedgebeur, Jan, M\u00e9lot, Hadrien: House of graphs: a database of interesting graphs. Discrete Appl. Math. 161(1\u20132), 311\u2013314 (2013)","journal-title":"Discrete Appl. Math."},{"key":"2901_CR4","first-page":"5","volume":"156","author":"DE Brown","year":"2002","unstructured":"Brown, D.E., Lundgren, J.R., Flink, S.C.: Interval $$k$$-graphs. Congressus Numerantium 156, 5\u201316 (2002)","journal-title":"Congressus Numerantium"},{"issue":"2","key":"2901_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190130206","volume":"13","author":"S Das","year":"1989","unstructured":"Das, S., Roy, A.B., Sen, M., West, D.B.: Interval digraphs: an analogue of interval graphs. J. Graph Theory 13(2), 189\u2013202 (1989)","journal-title":"J. Graph Theory"},{"key":"2901_CR6","unstructured":"Golumbic, M.C., Monma, C.L.: A generalization of interval graphs with tolerances. In: Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, Fla., 1982), vol. 35, pp. 321\u2013331 (1982)"},{"issue":"2","key":"2901_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"MC Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter, W.T., Jr.: Tolerance graphs. Discrete Appl. Math. 9(2), 157\u2013170 (1984)","journal-title":"Discrete Appl. Math."},{"key":"2901_CR8","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs, Volume\u00a089 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511542985"},{"key":"2901_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"2901_CR10","unstructured":"Haj\u00f6s, G.: \u00dcber eine art von graphen. Intern. Math. Nachr. 11:Problem 65 (1957)"},{"key":"2901_CR11","doi-asserted-by":"publisher","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"},{"issue":"1\u20133","key":"2901_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0012-365X(02)00685-4","volume":"268","author":"Clemens Heuberger","year":"2003","unstructured":"Heuberger, Clemens: On planarity and colorability of circulant graphs. Discrete Math. 268(1\u20133), 153\u2013169 (2003)","journal-title":"Discrete Math."},{"issue":"3","key":"2901_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"Joan P Hutchinson","year":"1999","unstructured":"Hutchinson, Joan P., Shermer, Thomas, Vince, Andrew: On representations of some thickness-two graphs. Comput. Geom. 13(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"2901_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0166-218X(98)00077-8","volume":"88","author":"FR McMorris","year":"1998","unstructured":"McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Appl. Math. 88, 315\u2013324 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2901_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(89)90271-9","volume":"73","author":"Erich Prisner","year":"1989","unstructured":"Prisner, Erich: A characterization of interval catch digraphs. Discrete Math. 73(3), 285\u2013289 (1989)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"2901_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(94)90104-X","volume":"51","author":"Erich Prisner","year":"1994","unstructured":"Prisner, Erich: Algorithms for interval catch digraphs. Discrete Appl. Math. 51(1\u20132), 147\u2013157 (1994)","journal-title":"Discrete Appl. Math."},{"key":"2901_CR17","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progress in Combinatorics (Proceedings of Third Waterloo Conference on Combinatorics, 1968), pp. 301\u2013310. Academic Press, New York (1969)"},{"issue":"3","key":"2901_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190030302","volume":"3","author":"WT Trotter Jr","year":"1979","unstructured":"Trotter, W.T., Jr., Harary, F.: On double and multiple interval graphs. J. Graph Theory 3(3), 205\u2013211 (1979)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02901-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:16:59Z","timestamp":1746253019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02901-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2901"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02901-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,3,13]]},"assertion":[{"value":"12 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"45"}}