{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:03:37Z","timestamp":1761807817337},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T00:00:00Z","timestamp":1358812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1241-4","type":"journal-article","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T08:30:57Z","timestamp":1358757057000},"page":"1713-1720","source":"Crossref","is-referenced-by-count":9,"title":["Colouring Clique-Hypergraphs of Circulant Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"C. N.","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Dantas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. P.","family":"de Mello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,22]]},"reference":[{"issue":"3","key":"1241_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1137\/S0895480199359995","volume":"17","author":"G. Bacs\u00f3","year":"2004","unstructured":"Bacs\u0151 G., Gravier S., Gy\u00e1rf\u00e1s A., Preissmann M., Seb\u0151 A.: Coloring the maximal cliques of graphs. SIAM J. Discrete Math. 17(3), 361\u2013376 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1241_CR2","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0402039","volume":"2","author":"J.C. Bermond","year":"1989","unstructured":"Bermond J.C., Peyrat C.: Induced subgraphs of the power of a cycle. SIAM Discrete Math. J. 2(4), 452\u2013455 (1989)","journal-title":"SIAM Discrete Math. J."},{"issue":"2","key":"1241_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02350629","volume":"8","author":"J.A. Bondy","year":"1992","unstructured":"Bondy J.A., Locke S.C.: Triangle-free subgraphs of powers of cycles. Graphs Combin. 8(2), 109\u2013118 (1992)","journal-title":"Graphs Combin."},{"key":"1241_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(96)00070-2","volume":"171","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt A., Dragan F.F., Nicolai F.: LexBFS-orderings and powers of chordal graphs. Discrete Math. 171, 27\u201342 (1997)","journal-title":"Discrete Math."},{"issue":"8","key":"1241_CR5","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.disc.2008.05.003","volume":"309","author":"J. Brown","year":"2009","unstructured":"Brown J., Hoshino R.: Independence polynomials of circulants with an application to music. Discrete Math. 309(8), 2292\u20132304 (2009)","journal-title":"Discrete Math."},{"issue":"5","key":"1241_CR6","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.dam.2006.08.010","volume":"155","author":"C.N. Campos","year":"2007","unstructured":"Campos C.N., de Mello C.P.: A result on the total colouring of powers of cycles. Discrete Appl. Math. 155(5), 585\u2013597 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"15","key":"1241_CR7","doi-asserted-by":"crossref","first-page":"3220","DOI":"10.1016\/j.disc.2007.06.027","volume":"308","author":"D. Chebikin","year":"2008","unstructured":"Chebikin D.: Graph powers and k-ordered Hamiltonicity. Discrete Math. 308(15), 3220\u20133229 (2008)","journal-title":"Discrete Math."},{"key":"1241_CR8","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas R.: The strong perfect graph theorem. Ann. Math. (2) 164(1), 51\u2013229 (2006)","DOI":"10.4007\/annals.2006.164.51"},{"key":"1241_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0024-3795(98)10126-X","volume":"285","author":"B. Codenotti","year":"1998","unstructured":"Codenotti B., Gerace I., Vigna S.: Hardness results and spectral techniques for combinatorial problems on circulant graphs. Linear Algebra Appl. 285, 123\u2013142 (1998)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1241_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/jgt.20177","volume":"53","author":"D. D\u00e9fossez","year":"2006","unstructured":"D\u00e9fossez D.: Clique-coloring some classes of odd-hole-free graphs. J. Graph Theory 53(3), 233\u2013249 (2006)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1241_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.20387","volume":"62","author":"D. D\u00e9fossez","year":"2009","unstructured":"D\u00e9fossez D.: Complexity of clique-coloring odd-hole-free graphs. J. Graph Theory 62(2), 139\u2013156 (2009)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1241_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0097-3165(91)90009-6","volume":"57","author":"D. Duffus","year":"1991","unstructured":"Duffus D., Sands B., Sauer N., Woodrow R.E.: Two-colouring all two-element maximal antichains. J. Combin. Theory Ser. A 57(1), 109\u2013116 (1991)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1241_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0012-365X(03)00197-3","volume":"272","author":"S. Gravier","year":"2003","unstructured":"Gravier S., Ho\u00e0ng C.T., Maffray F.: Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Math. 272, 285\u2013290 (2003)","journal-title":"Discrete Math."},{"key":"1241_CR14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(02)00685-4","volume":"268","author":"C. Heuberger","year":"2003","unstructured":"Heuberger C.: On planarity and colorability of circulant graphs. Discrete Math. 268, 153\u2013169 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"1241_CR15","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0196-6774(02)00221-3","volume":"45","author":"J. Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl J., Tuza Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1), 40\u201354 (2002)","journal-title":"J. Algorithms"},{"issue":"7","key":"1241_CR16","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1016\/j.ejc.2003.12.002","volume":"25","author":"M. Krivelevich","year":"2004","unstructured":"Krivelevich M., Nachmias A.: Colouring powers of cycles from random lists. Eur. J. Combin. 25(7), 961\u2013968 (2004)","journal-title":"Eur. J. Combin."},{"issue":"4","key":"1241_CR17","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1016\/j.ejc.2006.03.002","volume":"28","author":"D. Li","year":"2007","unstructured":"Li D., Liu M.: Hadwiger\u2019s conjecture for powers of cycles and their complements. Eur. J. Combin. 28(4), 1152\u20131155 (2007)","journal-title":"Eur. J. Combin."},{"key":"1241_CR18","first-page":"249","volume":"53","author":"C. Lin","year":"1999","unstructured":"Lin C., Lin J.J., Shyu T.W.: Isomorphic star decompositions of multicrowns and the power of cycles. Ars Combin. 53, 249\u2013256 (1999)","journal-title":"Ars Combin."},{"key":"1241_CR19","first-page":"65","volume":"49","author":"S.C. Locke","year":"1998","unstructured":"Locke S.C.: Further notes on: largest triangle-free subgraphs in powers of cycles. Ars Combin. 49, 65\u201377 (1998)","journal-title":"Ars Combin."},{"key":"1241_CR20","unstructured":"Meidanis, J.: Edge coloring of cycle powers is easy (1998). http:\/\/www.ic.unicamp.br\/~meidanis\/ . Unpublished manuscript, last visited 09\/12\/2012"},{"key":"1241_CR21","doi-asserted-by":"crossref","unstructured":"Muzychuk, M.E., Tinhofer, G.: Recognizing circulant graphs of prime order in polynomial time. Electron. J. Combin. 5, Research Paper 25, 28 (1998)","DOI":"10.37236\/1363"},{"key":"1241_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski J.: Sur le coloriage des graphs. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"1241_CR23","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disc.2004.03.020","volume":"299","author":"N. Obradovi\u0107","year":"2005","unstructured":"Obradovi\u0107 N., Peters J., Ru\u017ei\u0107 G.: Minimum chromaticity of circulant graphs. Discrete Math. 299, 288\u2013296 (2005)","journal-title":"Discrete Math."},{"issue":"6","key":"1241_CR24","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.ipl.2007.02.004","volume":"102","author":"N. Obradovi\u0107","year":"2007","unstructured":"Obradovi\u0107 N., Peters J., Ru\u017ei\u0107 G.: Efficient domination in circulant graphs with two chord lengths. Inform. Process. Lett. 102(6), 253\u2013258 (2007)","journal-title":"Inform. Process. Lett."},{"key":"1241_CR25","doi-asserted-by":"crossref","unstructured":"Oriolo, G., Stauffer, G.: Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. 115(2, Ser. A), 291\u2013317 (2008)","DOI":"10.1007\/s10107-007-0176-7"},{"issue":"3","key":"1241_CR26","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0095-8956(80)90088-X","volume":"29","author":"T.D. Parsons","year":"1980","unstructured":"Parsons T.D.: Circulant graph imbeddings. J. Combin. Theory Ser. B. 29(3), 310\u2013320 (1980)","journal-title":"J. Combin. Theory Ser. B."},{"issue":"1","key":"1241_CR27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","volume":"19","author":"A. Prowse","year":"2003","unstructured":"Prowse A., Woodall D.R.: Choosability of powers of circuits. Graphs Combin. 19(1), 137\u2013144 (2003)","journal-title":"Graphs Combin."},{"issue":"1","key":"1241_CR28","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jctb.2004.08.005","volume":"93","author":"C. Thomassen","year":"2005","unstructured":"Thomassen C.: Some remarks on Haj\u00f3s\u2019 conjecture. J. Combin. Theory Ser. B. 93(1), 95\u2013105 (2005)","journal-title":"J. Combin. Theory Ser. B."},{"issue":"18","key":"1241_CR29","doi-asserted-by":"crossref","first-page":"2275","DOI":"10.1016\/j.disc.2006.04.013","volume":"306","author":"M. Valencia-Pabon","year":"2006","unstructured":"Valencia-Pabon M., Vera J.: Independence and coloring properties of direct products of some vertex-transitive graphs. Discrete Math. 306(18), 2275\u20132281 (2006)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1241-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1241-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1241-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T20:14:05Z","timestamp":1595276045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1241-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,22]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1241"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1241-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,22]]}}}