克莱因瓶 II 不包括未成年人。级联

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2024-01-12 DOI:10.1016/j.jctb.2023.12.006

Bojan Mohar , Petr Škoda

{"title":"克莱因瓶 II 不包括未成年人。级联","authors":"Bojan Mohar , Petr Škoda","doi":"10.1016/j.jctb.2023.12.006","DOIUrl":null,"url":null,"abstract":"<div>Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I, it was shown that graphs that are critical for embeddings into surfaces of Euler genus k or for embeddings into nonorientable surface of genus k are built from 3-connected components, called hoppers and cascades. In Part II, all cascades for Euler genus 2 are classified. As a consequence, the complete list of obstructions of connectivity 2 for embedding graphs into the Klein bottle is obtained.</div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"166 ","pages":"Pages 80-108"},"PeriodicalIF":1.2000,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Excluded minors for the Klein bottle II. Cascades\",\"authors\":\"Bojan Mohar , Petr Škoda\",\"doi\":\"10.1016/j.jctb.2023.12.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I, it was shown that graphs that are critical for embeddings into surfaces of Euler genus k or for embeddings into nonorientable surface of genus k are built from 3-connected components, called hoppers and cascades. In Part II, all cascades for Euler genus 2 are classified. As a consequence, the complete list of obstructions of connectivity 2 for embedding graphs into the Klein bottle is obtained.</div>\",\"PeriodicalId\":54865,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series B\",\"volume\":\"166 \",\"pages\":\"Pages 80-108\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-01-12\",\"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/S0095895624000017\",\"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/S0095895624000017","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

研究了对嵌入曲面至关重要的图形（最小排除最小）。在第一部分中，研究表明对于嵌入欧拉属 k 的曲面或嵌入属 k 的不可定向曲面至关重要的图形是由 3 个相连的分量构建而成的，这些分量被称为跳板和级联。在第二部分中，将对欧拉属 2 的所有级联进行分类。因此，可以得到将图形嵌入克莱因瓶的连通性 2 的完整障碍列表。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Excluded minors for the Klein bottle II. Cascades

Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I, it was shown that graphs that are critical for embeddings into surfaces of Euler genus k or for embeddings into nonorientable surface of genus k are built from 3-connected components, called hoppers and cascades. In Part II, all cascades for Euler genus 2 are classified. As a consequence, the complete list of obstructions of connectivity 2 for embedding graphs into the Klein bottle is obtained.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： 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.