{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:56:48Z","timestamp":1720641408106},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1016\/j.endm.2017.10.013","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T11:47:10Z","timestamp":1509018430000},"page":"69-74","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bispindle in strongly connected digraphs with large chromatic number"],"prefix":"10.1016","volume":"62","author":[{"given":"Nathann","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[]},{"given":"William","family":"Lochet","sequence":"additional","affiliation":[]},{"given":"Raul","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.endm.2017.10.013_br0010","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/j.disc.2013.01.011","article-title":"Oriented trees in digraphs","volume":"313","author":"Addario-Berry","year":"2013","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.endm.2017.10.013_br0020","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","article-title":"Disconnected orientations and a conjecture of Las Vergnas","volume":"14","author":"Bondy","year":"1976","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/j.endm.2017.10.013_br0030","series-title":"Proceedings of the 11th Southeastern Conference on Combinatorics, Graph theory and Computing","first-page":"227","article-title":"Subtrees of directed graphs and hypergraphs","author":"Burr","year":"1980"},{"key":"10.1016\/j.endm.2017.10.013_br0040","doi-asserted-by":"crossref","first-page":"119","DOI":"10.4153\/CMB-1982-017-4","article-title":"Antidirected subtrees of directed graphs","volume":"25","author":"Burr","year":"1982","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.endm.2017.10.013_br0050","author":"Cohen"},{"key":"10.1016\/j.endm.2017.10.013_br0060","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","article-title":"Graph theory and probability","volume":"11","author":"Erd\u0151s","year":"1959","journal-title":"Canad. J. Math."},{"issue":"1\u20132","key":"10.1016\/j.endm.2017.10.013_br0070","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic number of graphs and set-systems","volume":"17","author":"Erd\u0151s","year":"1966","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"10.1016\/j.endm.2017.10.013_br0080","series-title":"Theory of Graphs","first-page":"115","article-title":"On directed paths and circuits","author":"Gallai","year":"1968"},{"key":"10.1016\/j.endm.2017.10.013_br0090","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/mana.19650280503","article-title":"Zur algebraischen bergr\u00fcnd der graphentheorie I","volume":"28","author":"Hasse","year":"1964","journal-title":"Math. Nachr."},{"key":"10.1016\/j.endm.2017.10.013_br0100","author":"Kim"},{"issue":"5","key":"10.1016\/j.endm.2017.10.013_br0110","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1051\/m2an\/1967010501291","article-title":"Nombre chromatique et plus longs chemins d'un graphe","volume":"1","author":"Roy","year":"1967","journal-title":"Rev. Francaise Informat. Recherche Op\u00e9rationnelle"},{"key":"10.1016\/j.endm.2017.10.013_br0120","first-page":"758","article-title":"Determination of minimal coloring of vertices of a graph by means of boolean powers of the incidence matrix","volume":"147","author":"Vitaver","year":"1962","journal-title":"Doklady Akademii Nauk SSSR"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302512?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302512?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T21:15:51Z","timestamp":1538687751000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065317302512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":12,"alternative-id":["S1571065317302512"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.013","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2017,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bispindle in strongly connected digraphs with large chromatic number","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}