A Möbius-type gluing technique for obtaining edge-critical graphs

S. Bonvicini, A. Vietri
{"title":"A Möbius-type gluing technique for obtaining edge-critical graphs","authors":"S. Bonvicini, A. Vietri","doi":"10.26493/1855-3974.2039.efc","DOIUrl":null,"url":null,"abstract":"Using a technique which is inspired by topology, we construct original examples of 3 - and 4 -edge critical graphs. The 3 -critical graphs cover all even orders starting from 26 ; the 4 -critical graphs cover all even orders starting from 20 and all the odd orders. In particular, the 3 -critical graphs are not isomorphic to the graphs provided by Goldberg for disproving the Critical Graph Conjecture. Using the same approach we also revisit the construction of some fundamental critical graphs, such as Goldberg’s infinite family of 3 -critical graphs, Chetwynd’s 4 -critical graph of order 16 and Fiol’s 4 -critical graph of order 18 .","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Math. Contemp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.2039.efc","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Using a technique which is inspired by topology, we construct original examples of 3 - and 4 -edge critical graphs. The 3 -critical graphs cover all even orders starting from 26 ; the 4 -critical graphs cover all even orders starting from 20 and all the odd orders. In particular, the 3 -critical graphs are not isomorphic to the graphs provided by Goldberg for disproving the Critical Graph Conjecture. Using the same approach we also revisit the construction of some fundamental critical graphs, such as Goldberg’s infinite family of 3 -critical graphs, Chetwynd’s 4 -critical graph of order 16 and Fiol’s 4 -critical graph of order 18 .
获得临界边图的Möbius-type粘合技术
利用一种受拓扑学启发的技术,我们构造了3边和4边临界图的原始示例。3临界图覆盖了从26开始的所有偶数阶;4临界图涵盖了从20开始的所有偶数阶和所有奇数阶。特别是,3临界图与Goldberg为反驳临界图猜想而提供的图是不同构的。使用同样的方法,我们还重新审视了一些基本临界图的构造,如Goldberg的无限3临界图族,Chetwynd的16阶4临界图和Fiol的18阶4临界图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信