{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:05:17Z","timestamp":1743087917545,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_24","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T01:27:34Z","timestamp":1320802054000},"page":"300-309","source":"Crossref","is-referenced-by-count":0,"title":["On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph"],"prefix":"10.1007","author":[{"given":"Bojan","family":"Mohar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"\u0160koda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.laa.2006.09.027","volume":"421","author":"P. Butkovi\u010d","year":"2007","unstructured":"Butkovi\u010d, P., Cuninghame-Green, R.A.: On matrix powers in max-algebra. Linear Algebra Appl.\u00a0421, 370\u2013381 (2007)","journal-title":"Linear Algebra Appl."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci.\u00a030, 54\u201376 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48708-8","volume-title":"Minimax Algebra","author":"R. Cuninghame-Green","year":"1979","unstructured":"Cuninghame-Green, R.: Minimax Algebra, vol.\u00a0166. Springer, Heidelberg (1979)"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.3190050107","volume":"5","author":"R.W. Decker","year":"1981","unstructured":"Decker, R.W., Glover, H.H., Huneke, J.P.: The genus of the 2-amalgamations of graphs. Journal of Graph Theory\u00a05(1), 95\u2013102 (1981)","journal-title":"Journal of Graph Theory"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02579241","volume":"5","author":"R.W. Decker","year":"1985","unstructured":"Decker, R.W., Glover, H.H., Huneke, J.P.: Computing the genus of the 2-amalgamations of graphs. Combinatorica\u00a05, 271\u2013282 (1985)","journal-title":"Combinatorica"},{"issue":"1-3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0024-3795(00)00020-3","volume":"307","author":"M. Gavalec","year":"2000","unstructured":"Gavalec, M.: Linear matrix period in max-plus algebra. Linear Algebra and its Applications\u00a0307(1-3), 167\u2013182 (2000)","journal-title":"Linear Algebra and its Applications"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM\u00a021, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math.\u00a015, 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Univ. Press, Baltimore (2001)"},{"key":"24_CR11","unstructured":"Mohar, B., \u0160koda, P.: Obstructions for xy-alternating embeddings of graphs in surfaces (in preparation)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"W.K. Shih","year":"1999","unstructured":"Shih, W.K., Hsu, W.L.: A new planarity test. Theor. Comput. Sci.\u00a0223, 179\u2013191 (1999)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T00:44:06Z","timestamp":1686444246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}