{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:16:39Z","timestamp":1751516199104,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_1","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Abreu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Cunha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tharso","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celina","family":"de Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Kowada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Marquezino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Portugal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11128-012-0432-5","volume":"11","author":"S Venegas-Andraca","year":"2012","unstructured":"Venegas-Andraca, S.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015\u20131106 (2012)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11128-015-1149-z","volume":"15","author":"R Portugal","year":"2016","unstructured":"Portugal, R., Santos, R.A.M., Fernandes, T.D., Gon\u00e7alves, D.N.: The staggered quantum walk model. Quantum Inf. Process. 15(1), 85\u2013101 (2016)","journal-title":"Quantum Inf. Process."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"062335","DOI":"10.1103\/PhysRevA.93.062335","volume":"93","author":"R Portugal","year":"2016","unstructured":"Portugal, R.: Staggered quantum walks on graphs. Phys. Rev. A 93, 062335 (2016)","journal-title":"Phys. Rev. A"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Abreu, A., Cunha, L., Fernandes, T., de Figueiredo, C., Kowada, L., Marquezino, F., Posner, D., Portugal, R.: Bounds and complexity for the tessellation problem. Mat. Contemp. (2017, accepted)","DOI":"10.21711\/231766362017\/rmc453"},{"key":"1_CR5","series-title":"CMS Books in Mathematics\/Ouvrages de math\u00e9matiques de la SMC","first-page":"109","volume-title":"Recent Advances in Algorithms and Combinatorics","author":"JL Szwarcfiter","year":"2003","unstructured":"Szwarcfiter, J.L.: A survey on clique graphs. In: Reed, B.A., Sales, C.L. (eds.) Recent Advances in Algorithms and Combinatorics. CBMOS, pp. 109\u2013136. Springer, New York (2003)"},{"key":"1_CR6","volume-title":"Introduction to Graph Theory","author":"D West","year":"2000","unstructured":"West, D.: Introduction to Graph Theory. Pearson, London (2000)"},{"key":"1_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Co., San Francisco (1979)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Zatesko, L.M., Carmo, R., Guedes, A.L.P.: Edge-colouring of triangle-free graphs with no proper majors. In: II Encontro de Teoria da Computa\u00e7\u00e3o, pp. 71\u201374 (2017)","DOI":"10.5753\/etc.2017.3181"},{"issue":"1","key":"1_CR9","first-page":"13","volume":"83","author":"DP Koreas","year":"1997","unstructured":"Koreas, D.P.: The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3. Appl. Math. Comput. 83(1), 13\u201317 (1997)","journal-title":"Appl. Math. Comput."},{"issue":"2\u20133","key":"1_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0166-218X(02)00200-7","volume":"126","author":"D Peterson","year":"2003","unstructured":"Peterson, D.: Gridline graphs: a review in two dimensions and an extension to higher dimensions. Discrete Appl. Math. 126(2\u20133), 223\u2013239 (2003)","journal-title":"Discrete Appl. Math."},{"key":"1_CR11","first-page":"97","volume":"80","author":"F Bonomo","year":"2006","unstructured":"Bonomo, F., Dur\u00e1n, G., Groshaus, M., Szwarcfiter, J.: On clique-perfect and K-perfect graphs. Ars Comb. 80, 97\u2013112 (2006)","journal-title":"Ars Comb."},{"key":"1_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H Bodlaender","year":"2004","unstructured":"Bodlaender, H., Kloks, T., Richard, B., van Leeuwen, J.: Approximation for lambda-colorings of graphs. Comput. J. 47, 1\u201312 (2004)","journal-title":"Comput. J."},{"key":"1_CR14","first-page":"193","volume":"40","author":"F Protti","year":"2002","unstructured":"Protti, F., Szwarcfiter, J.L.: Clique-inverse graphs of bipartite graphs. J. Comb. Math. Comb. Comput. 40, 193\u2013203 (2002)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"ND Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max $$\\{\\!{\\rm m},\\, {\\rm n}\\!\\}$$ algorithm for determining the graph H from its line graph G. Inf. Process. Lett. 2, 108\u2013112 (1973)","journal-title":"Inf. Process. Lett."},{"key":"1_CR16","unstructured":"McConnell, R., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2, pp. 536\u2013545 (1994)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree seven are class I. J. Comb. Theory B 83(2), 201\u2013212 (2001)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","volume":"30","author":"L Cai","year":"1991","unstructured":"Cai, L., Ellis, J.A.: NP-completeness of edge-colouring some restricted graphs. Discrete Appl. Math. 30(1), 15\u201327 (1991)","journal-title":"Discrete Appl. Math."},{"key":"1_CR19","unstructured":"Konno, N., Portugal, R., Sato, I., Segawa, E.: Partition-based discrete-time quantum walks"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:28:41Z","timestamp":1751480921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}