{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T09:19:02Z","timestamp":1773393542952,"version":"3.50.1"},"reference-count":6,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9803,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1979,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Chartrand and Stewart have shown that the line graph of an <jats:italic>n<\/jats:italic>\u2010connected graph is itself <jats:italic>n<\/jats:italic>\u2010connected. This paper shows that for every pair of integers <jats:italic>m<\/jats:italic> &gt; <jats:italic>n<\/jats:italic> &gt; 1 there is a graph of point connectivity <jats:italic>n<\/jats:italic> whose line graph has point connectivity <jats:italic>m<\/jats:italic>. The corresponding question for line connectivity is also resolved.<\/jats:p>","DOI":"10.1002\/jgt.3190030410","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:20:51Z","timestamp":1180419651000},"page":"393-395","source":"Crossref","is-referenced-by-count":12,"title":["Graphs with prescribed connectivity and line graph connectivity"],"prefix":"10.1002","volume":"3","author":[{"given":"Douglas","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralph","family":"Tindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Introdution to the Theory of Graphs","author":"Behzad M.","year":"1971"},{"key":"e_1_2_1_3_2","volume-title":"Examples and Counterexamples in Graph Theory","author":"Capobianco M.","year":"1978"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01350320"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"F.Harary Graph Theory. Addison\u2010Wesley Reading MA (1969).","DOI":"10.21236\/AD0705364"},{"issue":"2","key":"e_1_2_1_6_2","first-page":"75","article-title":"Prime line graphs","volume":"6","author":"Palmer E. M.","year":"1973","journal-title":"Nanta Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396460"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190030410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190030410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:23:20Z","timestamp":1699781000000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190030410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["10.1002\/jgt.3190030410"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190030410","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}