{"title":"Hamiltonian claw-free graphs with path-type local degree conditions","authors":"Xia Liu, Miao Wang, Shuo Zhang","doi":"10.1016/j.disc.2025.114807","DOIUrl":null,"url":null,"abstract":"<div><div>Let <em>k</em> be an integer and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> be a path on <em>k</em> vertices. For a graph <em>H</em> with an induced <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>, define <span><math><msub><mrow><mi>δ</mi></mrow><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msub><mo>(</mo><mi>H</mi><mo>)</mo><mo>=</mo><mi>min</mi><mo></mo><mo>{</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>H</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo></math></span>: <em>v</em> is an end-vertex of an induced <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> of <em>H</em>}. In this paper, we prove that for a 3-connected non-Hamiltonian claw-free graph <em>H</em>, <span><math><msub><mrow><mi>δ</mi></mrow><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msub><mo>(</mo><mi>H</mi><mo>)</mo><mo>=</mo><mi>δ</mi><mo>(</mo><mi>H</mi><mo>)</mo></math></span> for any <span><math><mn>1</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mn>9</mn></math></span>. As by-products, we obtained two results extend the results in Chen et al. (2017) <span><span>[10]</span></span>.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"349 3","pages":"Article 114807"},"PeriodicalIF":0.7000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25004157","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let k be an integer and be a path on k vertices. For a graph H with an induced , define : v is an end-vertex of an induced of H}. In this paper, we prove that for a 3-connected non-Hamiltonian claw-free graph H, for any . As by-products, we obtained two results extend the results in Chen et al. (2017) [10].
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.