{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T02:24:35Z","timestamp":1778034275571,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"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":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1016\/j.tcs.2012.06.015","type":"journal-article","created":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T20:30:58Z","timestamp":1341001858000},"page":"5-11","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Directed acyclic graphs with the unique dipath property"],"prefix":"10.1016","volume":"504","author":[{"given":"Jean-Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Cosnard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"P\u00e9rennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.06.015_br000005","doi-asserted-by":"crossref","unstructured":"J. Araujo, N. Cohen, F. Giroire, F. Havet, Good edge-labelling of graphs, Discrete Applied Mathematics (2011)http:\/\/dx.doi.org\/10.1016\/j.dam.2011.07.021 (in press).","DOI":"10.1016\/j.dam.2011.07.021"},{"key":"10.1016\/j.tcs.2012.06.015_br000010","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. P\u00e9rennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: IEEE Workshop on Optics and Computer Science, Geneva, Switzerland, April 1997."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2012.06.015_br000015","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2007.04.028","article-title":"Traffic grooming on the path","volume":"384","author":"Bermond","year":"2007","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.06.015_br000020","doi-asserted-by":"crossref","unstructured":"J.-C. Bermond, M. Cosnard, Minimum number of wavelengths equals load in a dag without internal cycle, in: Parallel and Distributed Processing Symposium, 2007, IPDPS 2007, IEEE International, Long Beach, CA, USA, March 2007, pp. 1\u201310.","DOI":"10.1109\/IPDPS.2007.370244"},{"key":"10.1016\/j.tcs.2012.06.015_br000025","doi-asserted-by":"crossref","unstructured":"J.-C. Bermond, M. Cosnard, D. Coudert, S. P\u00e9rennes, Optimal solution of the maximum all request path grooming problem, in: Proceedings of the Advanced International Conference on Telecommunications, AICT06, Guadeloupe, France, February 2006.","DOI":"10.1109\/AICT-ICIW.2006.144"},{"key":"10.1016\/j.tcs.2012.06.015_br000030","unstructured":"M. Bode, B. Farzad, D.O. Theis, Good edge-labelings and graphs with girth at least five, Technical report, http:\/\/arxiv.org\/abs\/1109.1125, 2011."},{"issue":"3","key":"10.1016\/j.tcs.2012.06.015_br000035","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(78)90102-4","article-title":"Chromatic number, girth and maximal degree","volume":"24","author":"Bollobas","year":"1978","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.tcs.2012.06.015_br000040","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10288-010-0150-8","article-title":"Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree","volume":"9","author":"Durand de~Gevigney","year":"2011","journal-title":"4OR"},{"issue":"6","key":"10.1016\/j.tcs.2012.06.015_br000045","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/MNET.2002.1081765","article-title":"Traffic grooming in WDM networks: past and future","volume":"16","author":"Dutta","year":"2002","journal-title":"IEEE Network"},{"key":"10.1016\/j.tcs.2012.06.015_br000050","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"10.1016\/j.tcs.2012.06.015_br000055","series-title":"Optical Communication Networks","author":"Mukherjee","year":"1997"},{"issue":"2","key":"10.1016\/j.tcs.2012.06.015_br000060","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(79)90084-4","article-title":"A short proof of the existence of highly chromatic hypergraphs without short cycles","volume":"27","author":"Nesetril","year":"2001","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512005841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512005841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T08:09:36Z","timestamp":1561882176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512005841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":12,"alternative-id":["S0304397512005841"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2012.06.015","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}