{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:27:26Z","timestamp":1648520846612},"reference-count":31,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>In this paper, we generalize the concepts of Eulerian and Hamiltonian digraphs to directed hypergraphs. A dihypergraphH is a pair (\ud835\udcb1(H), \u2130(H)), where \ud835\udcb1(H) is a non-empty set of elements, called vertices, and \u2130(H) is a collection of ordered pairs of subsets of \ud835\udcb1(H), called hyperarcs. It is Eulerian (resp. Hamiltonian) if there is a dicycle containing each hyperarc (resp. each vertex) exactly once. We first present some properties of Eulerian and Hamiltonian dihypergraphs. For example, we show that deciding whether a dihypergraph is Eulerian is an NP-complete problem. We also study when iterated line dihypergraphs are Eulerian and Hamiltonian. Finally, we study when the generalized de Bruijn dihypergraphs are Eulerian and Hamiltonian. In particular, we determine when they contain a complete Berge dicycle, i.e., an Eulerian and Hamiltonian dicycle.<\/jats:p>","DOI":"10.1142\/s1793830914500128","type":"journal-article","created":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T00:59:09Z","timestamp":1383181149000},"page":"1450012","source":"Crossref","is-referenced-by-count":2,"title":["EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS"],"prefix":"10.1142","volume":"06","author":[{"given":"JULIO","family":"ARAUJO","sequence":"first","affiliation":[{"name":"COATI Project, INRIA and I3S (CNRS\/UNS), 2004, Route des Lucioles, B.P. 93, F-06902 Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEAN-CLAUDE","family":"BERMOND","sequence":"additional","affiliation":[{"name":"COATI Project, INRIA and I3S (CNRS\/UNS), 2004, Route des Lucioles, B.P. 93, F-06902 Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GUILLAUME","family":"DUCOFFE","sequence":"additional","affiliation":[{"name":"University of Nice-Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"rf2","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2010"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00130-8"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2004.14"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.005"},{"key":"rf8","first-page":"16","volume":"25","author":"Batagelj V.","journal-title":"Publ. Inst. Math. Soc."},{"key":"rf9","doi-asserted-by":"crossref","DOI":"10.1016\/S0924-6509(09)70330-7","volume-title":"Graphs and Hypergraphs","volume":"6","author":"Berge C.","year":"1973"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70494-1"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00046-T"},{"key":"rf13","doi-asserted-by":"crossref","unstructured":"J.C.\u00a0Bermond, F.\u00a0Ergincan and M.\u00a0Syska, Quisquater Festschrift, Lecture Notes in Computer Science\u00a06805 (Springer-Verlag, Berlin, Heidelberg, 2011)\u00a0pp. 25\u201334.","DOI":"10.1007\/978-3-642-28368-0_5"},{"key":"rf15","volume-title":"Graph Theory with Applications","volume":"290","author":"Bondy J.","year":"2008"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00079-4"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-7177(97)00086-1"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<1::AID-JGT1>3.0.CO;2-I"},{"key":"rf20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4064\/-25-1-47-55","volume":"25","author":"Du D.-Z.","journal-title":"Banach Center Pub."},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90084-W"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90253-U"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00436-3"},{"key":"rf25","first-page":"169","volume":"38","author":"Du D.-Z.","journal-title":"Discrete Appl. Math."},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180105"},{"key":"rf27","volume-title":"Communications dans les R\u00e9seaux de Processeurs","author":"De Rumeur J.","year":"1994"},{"key":"rf29","doi-asserted-by":"crossref","first-page":"P46","DOI":"10.37236\/2055","volume":"19","author":"Dudek A.","journal-title":"Electron. J. Combin."},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00333-4"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1002\/net.10013"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00120-6"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(87)90024-1"},{"key":"rf34","first-page":"439","volume":"30","author":"Imase M.","journal-title":"IEEE Trans. Comput. C"},{"key":"rf35","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.11.013"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2010.02.010"},{"key":"rf37","first-page":"1","volume":"17","author":"Lonc Z.","journal-title":"Electron. J. Combin."},{"key":"rf39","volume-title":"Multiwavelength Optical Networks: A Layered Approach","author":"Stern T. E.","year":"1999"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T04:05:00Z","timestamp":1596773100000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":31,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,2,18]]},"published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1142\/S1793830914500128"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500128","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}