{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:43:34Z","timestamp":1768718614254,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114397","type":"print"},{"value":"9783642114403","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_13","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"136-148","source":"Crossref","is-referenced-by-count":1,"title":["Harmonious Coloring on Subclasses of Colinear Graphs"],"prefix":"10.1007","author":[{"given":"Kyriaki","family":"Ioannidou","sequence":"first","affiliation":[]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"2377","DOI":"10.1016\/j.dam.2007.07.005","volume":"155","author":"K. Asdre","year":"2007","unstructured":"Asdre, K., Ioannidou, K., Nikolopoulos, S.D.: The harmonious coloring problem is NP-complete for interval and permutation graphs. Discrete Applied Math.\u00a0155, 2377\u20132382 (2007)","journal-title":"Discrete Applied Math."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.tcs.2007.05.012","volume":"381","author":"K. Asdre","year":"2007","unstructured":"Asdre, K., Nikolopoulos, S.D.: NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theoret. Comput. Sci.\u00a0381, 248\u2013259 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"H.L. Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: Achromatic number is NP-complete for cographs and interval graphs. Inform. Proc. Lett.\u00a031, 135\u2013138 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"13_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/(SICI)1097-0118(199711)26:3<129::AID-JGT3>3.0.CO;2-T","volume":"26","author":"N. Cairnie","year":"1997","unstructured":"Cairnie, N., Edwards, K.: Some results on the achromatic number. J. Graph Theory\u00a026, 129\u2013136 (1997)","journal-title":"J. Graph Theory"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"G.J. Chang","year":"1988","unstructured":"Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Applied Math.\u00a022, 21\u201334 (1988)","journal-title":"Discrete Applied Math."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"I","author":"V. Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities for integer programming. Ann. Discrete Math.\u00a0I, 145\u2013162 (1977)","journal-title":"Ann. Discrete Math."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.jcta.2007.02.001","volume":"114","author":"Y. Civan","year":"2007","unstructured":"Civan, Y., Yal\u00e7in, E.: Linear colorings of simplicial complexes and collapsing. J. Comb. Theory A\u00a0114, 1315\u20131331 (2007)","journal-title":"J. Comb. Theory A"},{"key":"13_CR9","first-page":"13","volume-title":"Surveys in Combinatorics","author":"K.J. Edwards","year":"1997","unstructured":"Edwards, K.J.: The harmonious chromatic number and the achromatic number. In: Baily, R.A. (ed.) Surveys in Combinatorics, pp. 13\u201347. Cambridge University Press, Cambridge (1997)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","volume":"57","author":"K.J. Edwards","year":"1995","unstructured":"Edwards, K.J., McDiarmid, C.: The complexity of harmonious coloring for trees. Discrete Applied Math.\u00a057, 133\u2013144 (1995)","journal-title":"Discrete Applied Math."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math.\u00a043, 173\u2013189 (1983)","journal-title":"Discrete Math."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M. Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discrete Applied Math.\u00a07, 115\u2013130 (1984)","journal-title":"Discrete Applied Math."},{"key":"13_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H.\u00a0Freeman, San Francisco (1979)"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0012-365X(78)90003-1","volume":"23","author":"F. Gavril","year":"1978","unstructured":"Gavril, F.: A recognition algorithm for the intersection graph of paths of a tree. Discrete Math.\u00a023, 377\u2013388 (1978)","journal-title":"Discrete Math."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980); 2nd edn. Annals of Discrete Mathematics, vol. 57. Elsevier, Amsterdam (2004)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"13_CR16","unstructured":"Ioannidou, K., Nikolopoulos, S.D.: Colinear coloring and colinear graphs. Technical Report TR-2007-06, Department of Computer Science, University of Ioannina (2007)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Ioannidou, K., Nikolopoulos, S.D.: Colinear coloring on graphs. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 117\u2013128. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00202-1_11"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(90)90363-M","volume":"86","author":"D. Kratsch","year":"1990","unstructured":"Kratsch, D.: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. Discrete Math.\u00a086, 225\u2013238 (1990)","journal-title":"Discrete Math."},{"key":"13_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in Intersection Graph Theory","author":"T.A. McKee","year":"1999","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"C.L. Monma","year":"1986","unstructured":"Monma, C.L., Wei, V.K.: Intersection graphs of paths of a tree. J. Comb. Theory B\u00a041, 141\u2013181 (1986)","journal-title":"J. Comb. Theory B"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(93)90116-6","volume":"43","author":"A.A. Sch\u00e4ffer","year":"1993","unstructured":"Sch\u00e4ffer, A.A.: A faster algorithm to recognize undirected path graphs. Discrete Applied Math.\u00a043, 261\u2013295 (1993)","journal-title":"Discrete Applied Math."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Applied Math.\u00a038, 364\u2013372 (1980)","journal-title":"SIAM J. Applied Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:30Z","timestamp":1606185630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}