{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:33Z","timestamp":1759063713443},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00454-012-9446-0","type":"journal-article","created":{"date-parts":[[2012,7,17]],"date-time":"2012-07-17T16:06:19Z","timestamp":1342541179000},"page":"669-681","source":"Crossref","is-referenced-by-count":8,"title":["On the Connectivity of Visibility Graphs"],"prefix":"10.1007","volume":"48","author":[{"given":"Michael S.","family":"Payne","sequence":"first","affiliation":[]},{"given":"Attila","family":"P\u00f3r","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"key":"9446_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00373-010-0957-2","volume":"27","author":"Z. Abel","year":"2011","unstructured":"Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmovi\u0107, V., Hurtado, F., Kominers, S.D., Langerman, S., P\u00f3r, A., Wood, D.R.: Every large point set contains many collinear points or an empty pentagon. Graphs Comb. 27, 47\u201360 (2011)","journal-title":"Graphs Comb."},{"key":"9446_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0012-365X(99)00279-4","volume":"211","author":"P. Dankelmann","year":"2000","unstructured":"Dankelmann, P., Volkmann, L.: Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Math. 211, 217\u2013223 (2000)","journal-title":"Discrete Math."},{"key":"9446_CR3","first-page":"67","volume":"19","author":"A. Dumitrescu","year":"2009","unstructured":"Dumitrescu, A., Pach, J., T\u00f3th, G.: A note on blocking visibility between points. Geombinatorics 19, 67\u201373 (2009)","journal-title":"Geombinatorics"},{"key":"9446_CR4","series-title":"Algorithms Combin.","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete and Computational Geometry","author":"A. Kaneko","year":"2003","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane\u2014a survey. In: Discrete and Computational Geometry. Algorithms Combin., vol. 25, pp. 551\u2013570. Springer, Berlin (2003)"},{"key":"9446_CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00454-005-1177-z","volume":"34","author":"J. K\u00e1ra","year":"2005","unstructured":"K\u00e1ra, J., P\u00f3r, A., Wood, D.R.: On the chromatic number of the visibility graph of a set of points in the plane. Discrete Comput. Geom. 34, 497\u2013506 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9446_CR6","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"key":"9446_CR7","volume-title":"Universitext","author":"J. Matou\u0161ek","year":"2003","unstructured":"Matou\u0161ek, J.: Using the Borsuk\u2013Ulam theorem. In: Universitext. Springer, Berlin (2003)"},{"key":"9446_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00454-009-9185-z","volume":"42","author":"J. Matou\u0161ek","year":"2009","unstructured":"Matou\u0161ek, J.: Blocking visibility for points in general position. Discrete Comput. Geom. 42, 219\u2013223 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9446_CR9","unstructured":"Payne, M., P\u00f3r, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs (2011). http:\/\/arxiv.org\/abs\/1106.3622"},{"key":"9446_CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00454-008-9056-z","volume":"39","author":"F. Pfender","year":"2008","unstructured":"Pfender, F.: Visibility graphs of point sets in the plane. Discrete Comput. Geom. 39, 455\u2013459 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"9446_CR11","first-page":"71","volume":"30","author":"J. Plesn\u00edk","year":"1975","unstructured":"Plesn\u00edk, J.: Critical graphs of given diameter. Acta Fac. Rerum Nat. Univ. Comen. Math. 30, 71\u201393 (1975)","journal-title":"Acta Fac. Rerum Nat. Univ. Comen. Math."},{"key":"9446_CR12","first-page":"19","volume":"25","author":"J. Plesn\u00edk","year":"1989","unstructured":"Plesn\u00edk, J., Zn\u00e1m, \u0160.: On equality of edge-connectivity and minimum degree of a graph. Arch. Math. (Brno) 25, 19\u201325 (1989)","journal-title":"Arch. Math. (Brno)"},{"key":"9446_CR13","first-page":"29","volume":"1","author":"A. P\u00f3r","year":"2010","unstructured":"P\u00f3r, A., Wood, D.R.: On visibility and blockers. J. Comput. Geom. 1, 29\u201340 (2010)","journal-title":"J. Comput. Geom."},{"key":"9446_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L.A. Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Comb. Probab. Comput. 6, 353\u2013358 (1997)","journal-title":"Comb. Probab. Comput."},{"key":"9446_CR15","unstructured":"Trimble, T.: Solution to problem of the week No. 13\u2014highly coincidental. Accessed on 30\/3\/2011. http:\/\/topologicalmusings.wordpress.com\/2009\/07\/22\/solution-to-pow-13-highly-coincidental\/"},{"key":"9446_CR16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1002\/jgt.10087","volume":"42","author":"L. Volkmann","year":"2003","unstructured":"Volkmann, L.: Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. J. Graph Theory 42, 234\u2013245 (2003)","journal-title":"J. Graph Theory"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9446-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9446-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9446-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:50:36Z","timestamp":1559087436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9446-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9446"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9446-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}