{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:55:32Z","timestamp":1720054532652},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00230-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"215-236","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The total graph of a hypergraph"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Peter","family":"Cowling","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00230-0_BIB1","article-title":"Graphs and their Chromatic Numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB2","first-page":"383","article-title":"A characterization of total graphs","volume":"26","author":"Behzad","year":"1970"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB3","first-page":"158","article-title":"The total group of a graph","volume":"19","author":"Behzad","year":"1968"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1112\/jlms\/s1-44.1.433","article-title":"Structure of regular total graphs","volume":"45","author":"Behzad","year":"1969","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4064\/fm-117-1-1-4","article-title":"A characterization of middle graphs and a matroid associated with middle graphs of hypergraphs","volume":"CXVII","author":"Borowiecki","year":"1983","journal-title":"Fund. Math."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(94)00203-U","article-title":"Strong total chromatic numbers of complete hypergraphs","volume":"138","author":"Cowling","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB7","article-title":"Total colouring of hypergraphs and related topics","author":"Cowling","year":"1996"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB8","first-page":"151","article-title":"Total colouring of hypergraphs","volume":"19","author":"Cowling","year":"1995","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/net.3230080205","article-title":"A Recognition algorithm for the total graphs","volume":"8","author":"Gavril","year":"1978","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0012-365X(96)00230-0_BIB10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","article-title":"Labelling graphs with a condition at distance 2","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(94)90162-7","article-title":"Recent developments in total colouring","volume":"125","author":"Hind","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB12","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0095-8956(78)90075-8","article-title":"Nombre chromatique total d'un hypergraphe","volume":"24","author":"Meyer","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(84)90067-2","article-title":"An algorithm to recognise a middle graph","volume":"7","author":"Skowronska","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00230-0_BIB14","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/S0012-365X(96)00230-0_BIB15","article-title":"Labelling graphs with a condition at distance 2","author":"Yeh","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:43Z","timestamp":1556130463000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":15,"alternative-id":["S0012365X96002300"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00230-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}