{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T16:05:23Z","timestamp":1759421123894},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_3","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T12:08:51Z","timestamp":1401278931000},"page":"28-39","source":"Crossref","is-referenced-by-count":4,"title":["Happy Edges: Threshold-Coloring of Regular Lattices"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jackson","family":"Toeniskoetter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Kobourov, S.G., Pupyrev, S., Toeniskoetter, J.: Happy edges: Threshold-coloring of regular lattices. Arxiv report arxiv.org\/abs\/1306.2053 (2013)","DOI":"10.1007\/978-3-319-07890-8_3"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-45043-3_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.. J. Alam","year":"2013","unstructured":"Alam, M. J., Chaplick, S., Fijav\u017e, G., Kaufmann, M., Kobourov, S.G., Pupyrev, S.: Threshold-coloring and unit-cube contact representation of graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 26\u201337. Springer, Heidelberg (2013)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Albertson, M.O., Chappell, G.G., Kierstead, H.A., K\u00fcndgen, A., Ramamurthi, R.: Coloring with no 2-colored P 4. Electron. J. Combin.\u00a011(1), R26 (2004)","DOI":"10.37236\/1779"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-36763-2_17","volume-title":"Graph Drawing","author":"D. Bremner","year":"2013","unstructured":"Bremner, D., Evans, W., Frati, F., Heyer, L., Kobourov, S., Lenhart, W., Liotta, G., Rappaport, D., Whitesides, S.: On representing graphs by touching cuboids. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 187\u2013198. Springer, Heidelberg (2013)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"R.B. Eggleton","year":"1985","unstructured":"Eggleton, R.B., Erd\u00f6s, P., Skilton, D.K.: Colouring the real line. Journal of Combinatorial Theory, Series B\u00a039(1), 86\u2013100 (1985)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548304006637","volume":"14","author":"M. Ferrara","year":"2005","unstructured":"Ferrara, M., Kohayakawa, Y., R\u00f6dl, V.: Distance graphs on the integers. Combinatorics, Probability and Computing\u00a014, 107\u2013131 (2005)","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46784-X_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fiala","year":"1999","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of \u03bb-labelings. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 350\u2013363. Springer, Heidelberg (1999)"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00ecl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics\u00a0145(2), 306\u2013316 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms\u00a019(3), 449\u2013473 (1995)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics\u00a05(4), 586\u2013595 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"P.L. Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.: Difference graphs. Discrete Applied Mathematics\u00a028(1), 35\u201344 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR13","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. North-Holland (1995)"},{"key":"3_CR14","first-page":"1031","volume":"2","author":"F. Roberts","year":"1991","unstructured":"Roberts, F.: From garbage to rainbows: Generalizations of graph coloring and their applications. Graph Theory, Combinatorics, and Applications\u00a02, 1031\u20131052 (1991)","journal-title":"Graph Theory, Combinatorics, and Applications"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Timmons, C.: Star coloring high girth planar graphs. The Electronic Journal of Combinatorics 15(1), R124 (2008)","DOI":"10.37236\/848"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T04:03:06Z","timestamp":1597896186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}