{"title":"具有某些特殊周长的3连通图中最长环的弦","authors":"Danning Wang, Jun Yue","doi":"10.1016/j.dam.2025.08.040","DOIUrl":null,"url":null,"abstract":"<div><div>Thomassen’s chord conjecture from 1976 states that every longest cycle in a 3-connected graph has a chord. In this paper, we prove that it holds for any 3-connected graph with a small induced circumference or a large circumference.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"377 ","pages":"Pages 541-551"},"PeriodicalIF":1.0000,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Chords of longest cycles in 3-connected graphs with some special circumferences\",\"authors\":\"Danning Wang, Jun Yue\",\"doi\":\"10.1016/j.dam.2025.08.040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Thomassen’s chord conjecture from 1976 states that every longest cycle in a 3-connected graph has a chord. In this paper, we prove that it holds for any 3-connected graph with a small induced circumference or a large circumference.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"377 \",\"pages\":\"Pages 541-551\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X25004846\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25004846","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Chords of longest cycles in 3-connected graphs with some special circumferences
Thomassen’s chord conjecture from 1976 states that every longest cycle in a 3-connected graph has a chord. In this paper, we prove that it holds for any 3-connected graph with a small induced circumference or a large circumference.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.