n-Hamiltonian图

Journal of Combinatorial Theory Pub Date : 1970-10-01 DOI:10.1016/S0021-9800(70)80069-2

Gary Chartrand , S.F. Kapoor, Don R. Lick

{"title":"n-Hamiltonian图","authors":"Gary Chartrand , S.F. Kapoor, Don R. Lick","doi":"10.1016/S0021-9800(70)80069-2","DOIUrl":null,"url":null,"abstract":"<div>A graph G with p≥3 points, 0≤n≤p−3, is called n-Hamiltonian if the removal of any k points from G, 0≤k≤n, results in a Hamiltonian graph. This generalizes the concept of Hamiltonian graphs in as much as the 0-Hamiltonian graphs are precisely the Hamiltonian graphs. Sufficient conditions for a graph to be n-Hamiltonian are presented, including generalizations of results on Hamiltonian graphs due to Dirac, Ore, and Pósa.</div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 3","pages":"Pages 308-312"},"PeriodicalIF":0.0000,"publicationDate":"1970-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80069-2","citationCount":"29","resultStr":"{\"title\":\"n-Hamiltonian graphs\",\"authors\":\"Gary Chartrand , S.F. Kapoor, Don R. Lick\",\"doi\":\"10.1016/S0021-9800(70)80069-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>A graph G with p≥3 points, 0≤n≤p−3, is called n-Hamiltonian if the removal of any k points from G, 0≤k≤n, results in a Hamiltonian graph. This generalizes the concept of Hamiltonian graphs in as much as the 0-Hamiltonian graphs are precisely the Hamiltonian graphs. Sufficient conditions for a graph to be n-Hamiltonian are presented, including generalizations of results on Hamiltonian graphs due to Dirac, Ore, and Pósa.</div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 3\",\"pages\":\"Pages 308-312\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80069-2\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800692\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

图G中p≥3个点，0≤n≤p−3，如果从G中取去任意k个点，得到一个哈密顿图，则称为n-哈密顿图。这推广了哈密顿图的概念因为0-哈密顿图就是哈密顿图。给出了图是n-哈密顿图的充分条件，包括由Dirac, Ore和Pósa引起的关于哈密顿图的结果的推广。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

n-Hamiltonian graphs

A graph G with p≥3 points, 0≤n≤p−3, is called n-Hamiltonian if the removal of any k points from G, 0≤k≤n, results in a Hamiltonian graph. This generalizes the concept of Hamiltonian graphs in as much as the 0-Hamiltonian graphs are precisely the Hamiltonian graphs. Sufficient conditions for a graph to be n-Hamiltonian are presented, including generalizations of results on Hamiltonian graphs due to Dirac, Ore, and Pósa.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory

自引率

0.00%

发文量