{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T09:40:13Z","timestamp":1697535613427},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T00:00:00Z","timestamp":1337299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2013,3]]},"abstract":"Abstract<\/jats:title>Let X<\/jats:italic>, Y<\/jats:italic> be connected graphs. A graph G<\/jats:italic> is \u2010free if G<\/jats:italic> contains a copy of neither X<\/jats:italic> nor Y<\/jats:italic> as an induced subgraph. Pairs of connected graphs such that every 3\u2010connected \u2010free graph is Hamilton connected have been investigated most recently in (Guantao Chen and Ronald J. Gould, Bull. Inst. Combin. Appl., 29 (2000), 25\u201332.) [8] and (H. Broersma, R. J. Faudree, A. Huck, H. Trommel, and H. J. Veldman, J. Graph Theory, 40(2) (2002), 104\u2013119.) [5]. This paper improves those results. Specifically, it is shown that every 3\u2010connected \u2010free graph is Hamilton connected for and or N<\/jats:italic>1, 2, 2<\/jats:sub> and the proof of this result uses a new closure technique developed by the third and fourth authors. A discussion of restrictions on the nature of the graph Y<\/jats:italic> is also included.<\/jats:p>","DOI":"10.1002\/jgt.21645","type":"journal-article","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T15:09:29Z","timestamp":1337353769000},"page":"327-345","source":"Crossref","is-referenced-by-count":3,"title":["On Forbidden Pairs Implying Hamilton\u2010Connectedness"],"prefix":"10.1002","volume":"72","author":[{"given":"Jill R.","family":"Faudree","sequence":"first","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE UNIVERSITY OF ALASKA AT FAIRBANKS FAIRBANKS AK, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralph J.","family":"Faudree","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF MEMPHIS MEMPHIS TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zden\u011bk","family":"Ryj\u00e1\u010dek","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS UNIVERSITY OF WEST BOHEMIA INSTITUTE FOR THEORETICAL COMPUTER SCIENCE (ITI) CHARLES UNIVERSITY P.O. BOX 314 306 14 PILSEN CZECH REPUBLIC"},{"name":"RESEARCH SUPPORTED BY GRANTS NO. 1M0545 AND MSM 4977751301 OF THE CZECH MINISTRY OF EDUCATION"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Vr\u00e1na","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS UNIVERSITY OF WEST BOHEMIA INSTITUTE FOR THEORETICAL COMPUTER SCIENCE (ITI) CHARLES UNIVERSITY P.O. BOX 314 306 14 PILSEN CZECH REPUBLIC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2012,5,18]]},"reference":[{"key":"e_1_2_5_2_1","unstructured":"P.Bedrossian Forbidden Subgraph and Minimum Degree Conditions for Hamiltonicity Ph.D Thesis Memphis State University Memphis Tennessee TN United States 1991."},{"key":"e_1_2_5_3_1","first-page":"299","article-title":"Graphe representatif des arretes d'un multigraphe","volume":"52","author":"Bermond J. C.","year":"1973","journal-title":"J Math Pures et Appl"},{"key":"e_1_2_5_4_1","first-page":"17","volume-title":"Beitrage zur Graphentheorie","author":"Beineke L. W.","year":"1968"},{"key":"e_1_2_5_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00165-4"},{"key":"e_1_2_5_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10034"},{"key":"e_1_2_5_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00334-3"},{"key":"e_1_2_5_8_1","volume-title":"Graphs & digraphs","author":"Chartrand G.","year":"2005"},{"key":"e_1_2_5_9_1","first-page":"25","article-title":"Hamiltonian connected graphs involving forbidden subgraphs","volume":"29","author":"Chen G.","year":"2000","journal-title":"Bull Inst Combin Appl"},{"key":"e_1_2_5_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00147-1"},{"key":"e_1_2_5_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-051-3"},{"key":"e_1_2_5_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.04.005"},{"key":"e_1_2_5_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20497"},{"key":"e_1_2_5_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20498"},{"key":"e_1_2_5_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90074-T"},{"key":"e_1_2_5_16_1","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1997.7.3.287"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.21645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.21645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T12:23:15Z","timestamp":1697458995000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.21645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,18]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1002\/jgt.21645"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/jgt.21645","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,18]]}}}