{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:34Z","timestamp":1759063714293},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1779-2","type":"journal-article","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T09:48:30Z","timestamp":1496310510000},"page":"1023-1035","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unit Hypercube Visibility Numbers of Trees"],"prefix":"10.1007","volume":"33","author":[{"given":"Eric","family":"Peterson","sequence":"first","affiliation":[]},{"given":"Paul S.","family":"Wenger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,1]]},"reference":[{"issue":"3","key":"1779_CR1","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1137\/120864234","volume":"27","author":"M Axenovich","year":"2013","unstructured":"Axenovich, M., Beveridge, A., Hutchinson, J.P., West, D.B.: Visibility number of directed graphs. SIAM J. Discret. Math. 27(3), 1429\u20131449 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"1779_CR2","unstructured":"Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Sivadasan, N.: Approximating the Cubicity of Trees. arXiv:1402.6310 [cs.DM]"},{"key":"1779_CR3","first-page":"25","volume-title":"Lecture Notes in Computer Science 1190: Graph Drawing","author":"P Bose","year":"1997","unstructured":"Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: North, S. (ed.) Lecture Notes in Computer Science 1190: Graph Drawing, pp. 25\u201344. Springer, Berlin (1997)"},{"key":"1779_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P Buneman","year":"1974","unstructured":"Buneman, P.: A characterisation of rigid circuit graphs. Discret. Math. 9, 205\u2013212 (1974)","journal-title":"Discret. Math."},{"issue":"3","key":"1779_CR5","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1137\/S0895480198343455","volume":"18","author":"Y Chang","year":"2004","unstructured":"Chang, Y., Hutchinson, J.P., Jacobson, M.S., Lehel, J., West, D.B.: The bar visibility number of a graph. SIAM J. Discret. Math. 18(3), 462\u2013471 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"1779_CR6","doi-asserted-by":"crossref","unstructured":"Cobos, F.J., Dana, J.C., Hurtado, F., Marquez, A., Mateos, F.: On a visibility representation of graphs. In: Lecture Notes in Computer Science 1027: Graph Drawing, pp. 152\u2013161. Springer, Berlin (1995)","DOI":"10.1007\/BFb0021799"},{"key":"1779_CR7","first-page":"111","volume-title":"Lecture Notes in Computer Science 3383: Graph Drawing","author":"A Dean","year":"2004","unstructured":"Dean, A., Gethner, E., Hutchinson, J.: Unit bar-visibility layouts of triangulated polygons: extended abstract. In: Pach, J. (ed.) Lecture Notes in Computer Science 3383: Graph Drawing, pp. 111\u2013121. Springer, Berlin (2004)"},{"issue":"1","key":"1779_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0166-218X(96)00029-7","volume":"75","author":"AM Dean","year":"1997","unstructured":"Dean, A.M., Hutchinson, J.: Rectangle-visibility representations of bipartite graphs. Discret. Appl. Math. 75(1), 9\u201325 (1997)","journal-title":"Discret. Appl. Math."},{"key":"1779_CR9","doi-asserted-by":"crossref","unstructured":"Dean, A.M., Hutchinson, J.: Rectangle-visibility layouts of unions and products of trees. J. Graph Algorithms Appl. 2(8), 21 (1998) (electronic)","DOI":"10.7155\/jgaa.00011"},{"key":"1779_CR10","doi-asserted-by":"crossref","unstructured":"Dean, A.M., Ellis-Monaghan, J.A., Hamilton, S., Pangborne, G.: Unit rectangle visibility graphs. Electron. J. Comb. 15, 79 (2008)","DOI":"10.37236\/803"},{"key":"1779_CR11","first-page":"161","volume":"160","author":"AM Dean","year":"2003","unstructured":"Dean, A.M., Veytsel, N.: Unit bar-visibility graphs. Congr. Numer. 160, 161\u2013175 (2003)","journal-title":"Congr. Numer."},{"issue":"3","key":"1779_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","volume":"46","author":"P Duchet","year":"1983","unstructured":"Duchet, P., Hamidoune, Y., Las Vergnas, M., Meyniel, H.: Representing a planar graph by vertical lines joining different levels. Discret. Math. 46(3), 319\u2013321 (1983)","journal-title":"Discret. Math."},{"key":"1779_CR13","doi-asserted-by":"crossref","unstructured":"Fekete, S., Houle, M., Whitesides, S.: New results on a visibility representation of graphs in 3D, Graph drawing (Passau, 1995), 234\u2013241. In: Lecture Notes in Comput. Sci., p. 1027. Springer, Berlin (1996)","DOI":"10.1007\/BFb0021807"},{"issue":"1","key":"1779_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195999000029","volume":"9","author":"S Fekete","year":"1999","unstructured":"Fekete, S., Meijer, H.: Rectangle and box visibility graphs in 3D. Internat. J. Comput. Geom. Appl. 9(1), 1\u201327 (1999)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"2","key":"1779_CR15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.7155\/jgaa.00393","volume":"20","author":"E Gaub","year":"2016","unstructured":"Gaub, E., Rose, M., Wenger, P.: The unit bar visibility number of a graph. J. Graph Algorithms Appl. 20(2), 269\u2013297 (2016)","journal-title":"J. Graph Algorithms Appl."},{"key":"1779_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graph. J. Comb. Theory Ser. B 16, 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1779_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2014.10.042","volume":"575","author":"SK Ghosh","year":"2015","unstructured":"Ghosh, S.K., Roy, B.: Some results on point visibility graphs. Theor. Comp. Sci. 575, 17\u201332 (2015)","journal-title":"Theor. Comp. Sci."},{"key":"1779_CR18","first-page":"241","volume":"25","author":"JP Hutchinson","year":"2002","unstructured":"Hutchinson, J.P.: Arc- and circle-visibility graphs. Aust. J. Comb. 25, 241\u2013262 (2002)","journal-title":"Aust. J. Comb."},{"issue":"3","key":"1779_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.dam.2004.12.004","volume":"148","author":"JP Hutchinson","year":"2005","unstructured":"Hutchinson, J.P.: A note on rectilinear and polar visibility graphs. Discret. Appl. Math. 148(3), 263\u2013272 (2005)","journal-title":"Discret. Appl. Math."},{"key":"1779_CR20","unstructured":"Peterson, E.: Rectangle Visibility Numbers of Graphs, Master\u2019s Thesis, Rochester Institute of Technology, p. 40 (2016)"},{"issue":"4","key":"1779_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1(4), 321\u2013341 (1986)","journal-title":"Discret. Comput. Geom."},{"key":"1779_CR22","unstructured":"Walter, J.R.: Representations of Rigid Cycle Graphs, Ph.D. Thesis, Wayne State University, p. 107 (1972)"},{"issue":"3","key":"1779_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"JR Walter","year":"1978","unstructured":"Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J. Graph Theory 2(3), 265\u2013267 (1978)","journal-title":"J. Graph Theory"},{"key":"1779_CR24","doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of the first annual symposium on Computational geometry, ACM (1985)","DOI":"10.1145\/323233.323253"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1779-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1779-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1779-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T05:07:21Z","timestamp":1602220041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1779-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1779"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1779-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,1]]}}}