Linda Cook , Jake Horsfield , Myriam Preissmann , Cléophée Robin , Paul Seymour , Ni Luh Dewi Sintiari , Nicolas Trotignon , Kristina Vušković
{"title":"所有孔长度相同的图形","authors":"Linda Cook , Jake Horsfield , Myriam Preissmann , Cléophée Robin , Paul Seymour , Ni Luh Dewi Sintiari , Nicolas Trotignon , Kristina Vušković","doi":"10.1016/j.jctb.2024.04.006","DOIUrl":null,"url":null,"abstract":"<div><p>A graph is <em>ℓ-holed</em> if all its induced cycles of length at least four have length exactly <em>ℓ</em>. We give a complete description of the <em>ℓ</em>-holed graphs for each <span><math><mi>ℓ</mi><mo>≥</mo><mn>7</mn></math></span>.</p></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"168 ","pages":"Pages 96-158"},"PeriodicalIF":1.2000,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graphs with all holes the same length\",\"authors\":\"Linda Cook , Jake Horsfield , Myriam Preissmann , Cléophée Robin , Paul Seymour , Ni Luh Dewi Sintiari , Nicolas Trotignon , Kristina Vušković\",\"doi\":\"10.1016/j.jctb.2024.04.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A graph is <em>ℓ-holed</em> if all its induced cycles of length at least four have length exactly <em>ℓ</em>. We give a complete description of the <em>ℓ</em>-holed graphs for each <span><math><mi>ℓ</mi><mo>≥</mo><mn>7</mn></math></span>.</p></div>\",\"PeriodicalId\":54865,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series B\",\"volume\":\"168 \",\"pages\":\"Pages 96-158\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series B\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0095895624000327\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000327","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
A graph is ℓ-holed if all its induced cycles of length at least four have length exactly ℓ. We give a complete description of the ℓ-holed graphs for each .
期刊介绍：
The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
