{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:06Z","timestamp":1725502026999},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_32","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"327-338","source":"Crossref","is-referenced-by-count":2,"title":["Colorability in Orthogonal Graph Drawing"],"prefix":"10.1007","author":[{"given":"Jan","family":"\u0160tola","sequence":"first","affiliation":[]}],"member":"297","reference":[{"unstructured":"Wood, D.R.: Three-Dimensional Orthogonal Graph Drawing, Ph.D. Thesis, School of Computer Science and Software Engineering, Monash University (2000)","key":"32_CR1"},{"key":"32_CR2","first-page":"1","volume":"97","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Meijer, H.: Rectangle and box visibility graphs in 3D. Int. J. Comput. Geom. Appl.\u00a097, 1\u201328 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Houle, M.E., Whitesides, S.: New results on a\u00a0visibility representation of graphs in 3D. In: Proc. Graph Drawing, vol.\u00a095, pp. 234\u2013241 (1995)","key":"32_CR3","DOI":"10.1007\/BFb0021807"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: Proc. Graph Drawing, vol.\u00a096, pp. 25\u201344 (1996)","key":"32_CR4","DOI":"10.1007\/3-540-62495-3_35"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"J.P. Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T., Vince, A.: On representations of some thickness-two graphs. Comput. Geom.\u00a013(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Dean, A.M., Hutchinson, J.P.: Rectangle-visibility Layouts of Unions and Products of Trees. J. Graph Algorithms Appl., 1\u201321 (1998)","key":"32_CR6","DOI":"10.7155\/jgaa.00011"},{"key":"32_CR7","series-title":"Int. Informatics Series","first-page":"234","volume-title":"Proc. of 8th Canadian Conf. on Comput. Geom.","author":"T. Shermer","year":"1996","unstructured":"Shermer, T.: Block visibility representations III: External visibility and complexity. In: Fiala, K., Sack (eds.) Proc. of 8th Canadian Conf. on Comput. Geom. Int. Informatics Series, vol.\u00a05, pp. 234\u2013239. Carleton University Press, Ottawa (1996)"},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Houle, M.E., Whitesides, S.:: The wobbly logic engine: proving hardness of non-rigid geometric graph representation problems, Report No. 97.273, Angewandte Mathematik und Informatik Universit\u00e4t zu K\u00f6ln (1997)","key":"32_CR8","DOI":"10.1007\/3-540-63938-1_69"},{"unstructured":"\u0160tola, J.: Chromatic invariants in graph drawing, Master\u2019s Thesis, Department of Applied Mathematics, Charles University, Prague, Czech Republic (2006), http:\/\/kam.mff.cuni.cz\/~stola\/chromaticInvariants.pdf","key":"32_CR9"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.4153\/CMB-1969-040-1","volume":"12","author":"V. Chv\u00e1tal","year":"1969","unstructured":"Chv\u00e1tal, V.: On finite polarized partition relations. Canad. Math. Bul.\u00a012, 321\u2013326 (1969)","journal-title":"Canad. Math. Bul."},{"unstructured":"Beineke, L.W., Schwenk, A.J.: On a bipartite form of the Ramsey problem. In: Proc. 5th British Combin. Conf. 1975, Congr. Numer., vol.\u00a0XV, pp. 17\u201322 (1975)","key":"32_CR11"},{"issue":"4","key":"32_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"Biedl, T., Shermer, T., Whitesides, S., Wismath, S.: Bounds for orthogonal 3D graph drawing. J. Graph Alg. Appl.\u00a03(4), 63\u201379 (1999)","journal-title":"J. Graph Alg. Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:54Z","timestamp":1619522154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_32","relation":{},"subject":[]}}