{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:34:00Z","timestamp":1648928040651},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T00:00:00Z","timestamp":1382486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9669-x","type":"journal-article","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T12:44:08Z","timestamp":1382445848000},"page":"803-811","source":"Crossref","is-referenced-by-count":2,"title":["$$L(1,1)$$ L ( 1 , 1 ) -labelling of the direct product of a complete graph and a cycle"],"prefix":"10.1007","volume":"30","author":[{"given":"Byeong Moon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoomi","family":"Rho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Chul","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,23]]},"reference":[{"key":"9669_CR1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender HL, Kloks T, Tan RB, van Leeuwen J (2004) Approximations for $$\\lambda $$ \u03bb -coloring of graphs. Comput J 47:193\u2013204","journal-title":"Comput J"},{"key":"9669_CR2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T (2006) The $$L(h, k)$$ L ( h , k ) -labeling problem: a survey and annotated bibliography. Comput J 49:585\u2013608","journal-title":"Comput J"},{"key":"9669_CR3","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri T (2011) The L(h, k)-labelling problem: an updated survey and annotated bibliography. Comput J 54:1344\u20131371","journal-title":"Comput J"},{"key":"9669_CR4","unstructured":"Calamoneri T, Vocca P (2005) Approximability of the $$L(h, k)$$ L ( h , k ) -labeling problem. In Proceedings of 12th Colloquium on structural information and communication complexity (SIROCCO), Le Mont Saint-Michel, France, LNCS 3499, pp 65\u201377"},{"key":"9669_CR5","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance two. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9669_CR6","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497\u20131514","journal-title":"Proc IEEE"},{"issue":"1","key":"9669_CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TCSII.2007.908918","volume":"55","author":"E Haque","year":"2008","unstructured":"Haque E, Jha PK (2008) $$L(j, k)$$ L ( j , k ) -labelings of Kronecker products of complete graphs. IEEE Trans Circuits Syst II 55(1):70\u201373","journal-title":"IEEE Trans Circuits Syst II"},{"key":"9669_CR8","first-page":"275","volume":"30","author":"F Kramer","year":"1986","unstructured":"Kramer F, Kramer H (1986) On the generalized chromatic number. Ann Discret Math 30:275\u2013284","journal-title":"Ann Discret Math"},{"key":"9669_CR9","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F Kramer","year":"2008","unstructured":"Kramer F, Kramer H (2008) A survey on the distance-coloring of graphs. Discret Math 308:422\u2013426","journal-title":"Discret Math"},{"key":"9669_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"SO Krumke","year":"2001","unstructured":"Krumke SO, Marathe MV, Ravi SS (2001) Models and approximation algorithms for channel assignment in radio networks. Wirel Netw 7:575\u2013584","journal-title":"Wirel Netw"},{"key":"9669_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10878-007-9057-5","volume":"14","author":"PCB Lam","year":"2007","unstructured":"Lam PCB, Lin W, Wu J (2007) $$L(j, k)$$ L ( j , k ) labelings for the products of complete graphs. J Comput Optim 14:219\u2013227","journal-title":"J Comput Optim"},{"key":"9669_CR12","doi-asserted-by":"crossref","first-page":"3805","DOI":"10.1016\/j.disc.2007.06.046","volume":"308","author":"W Lin","year":"2008","unstructured":"Lin W, Lam PCB (2008) Distance two labeling and direct products of graphs. Discret Math 308:3805\u20133815","journal-title":"Discret Math"},{"key":"9669_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J Comb Theory B 94:189\u2013213","journal-title":"J Comb Theory B"},{"key":"9669_CR14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01788540","volume":"3","author":"S Poljak","year":"1987","unstructured":"Poljak S, Tuza Zs (1987) Maximum bipartite subgraphs of Kneser graphs. Graphs Comb 3:191\u2013199","journal-title":"Graphs Comb"},{"key":"9669_CR15","volume-title":"Graph theory, combinatorics and applications","author":"FS Roberts","year":"1991","unstructured":"Roberts FS (1991a) From garbage to rainbows: generalizations of graph coloring and their applications. In: Alavi Y, Chartrand G, Oellermann OR, Schwenk AJ (eds) Graph theory, combinatorics and applications. Wiley, New York"},{"key":"9669_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts FS (1991b) T-colorings of graphs: recent results and open probelms. Discret Math 93:229\u2013245","journal-title":"Discret Math"},{"key":"9669_CR17","unstructured":"Ramanathan S, Lloyd EL (1992) The complexity of distance-2-coloring. In: Proceedings of the Fourth International Conference on Computing and Information (ICCI 92), May 28\u201330, IEEE Computer Society Press, pp 71\u201374."},{"key":"9669_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D Sakai","year":"1994","unstructured":"Sakai D (1994) Labelling chordal graphs: Distance two condition. SIAM J Discet Math 7:133\u2013140","journal-title":"SIAM J Discet Math"},{"key":"9669_CR19","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1016\/j.disc.2013.01.025","volume":"313","author":"Z Shao","year":"2013","unstructured":"Shao Z, Vesel A (2013) A note on the chromatic number of the square of the Cartesian product of two cycles. Discret Math 313:999\u20131001","journal-title":"Discret Math"},{"key":"9669_CR20","doi-asserted-by":"crossref","first-page":"2327","DOI":"10.1016\/j.disc.2010.05.011","volume":"310","author":"E Sopena","year":"2010","unstructured":"Sopena E, Wu J (2010) Coloring the square of the Cartesian product of two cycles. Discret Math 310:2327\u20132333","journal-title":"Discret Math"},{"key":"9669_CR21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel van den","year":"2003","unstructured":"van den Heuvel J, McGuinness S (2003) Coloring the square of a planar graph. J Graph Theory 42:110\u2013124","journal-title":"J Graph Theory"},{"key":"9669_CR22","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"MA Whittlesey","year":"1995","unstructured":"Whittlesey MA, Georges JP, Mauro DW (1995) On the $$\\lambda $$ \u03bb -number of $$Q_n$$ Q n and related graphs. SIAM J Discret Math 8:499\u2013506","journal-title":"SIAM J Discret Math"},{"key":"9669_CR23","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"RK Yeh","year":"2006","unstructured":"Yeh RK (2006) A survey on labeling graphs with a condition two. Discret Math 306:1217\u20131231","journal-title":"Discret Math"},{"key":"9669_CR24","first-page":"671","volume":"E83\u2013A","author":"X Zhou","year":"2000","unstructured":"Zhou X, Kanari Y, Nishizeki T (2000) Generalized vertex coloring of partial $$k$$ k -trees. IEICE Trans Fundam Electron Commun Comput Sci E83\u2013A:671\u2013678","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9669-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9669-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9669-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9669-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,23]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9669"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9669-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,23]]}}}