{"title":"获得临界边图的Möbius-type粘合技术","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":"23 1","pages":"209-229"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"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\":\"23 1\",\"pages\":\"209-229\"},\"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}","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}
A Möbius-type gluing technique for obtaining edge-critical graphs
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 .