{"title":"具有独立交叉的外平面图的强边缘着色","authors":"Ke-Jie Li, Xin Zhang","doi":"10.1007/s10255-024-1026-6","DOIUrl":null,"url":null,"abstract":"<div><p>The strong chromatic index of a graph is the minimum number of colors needed in a proper edge coloring so that no edge is adjacent to two edges of the same color. An outerplane graph with independent crossings is a graph embedded in the plane in such a way that all vertices are on the outer face and two pairs of crossing edges share no common end vertex. It is proved that every outerplane graph with independent crossings and maximum degree Δ has strong chromatic index at most 4Δ − 6 if Δ ≥ 4, and at most 8 if Δ ≤ 3. Both bounds are sharp.</p></div>","PeriodicalId":6951,"journal":{"name":"Acta Mathematicae Applicatae Sinica, English Series","volume":"40 2","pages":"467 - 477"},"PeriodicalIF":0.9000,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Strong Edge Coloring of Outerplane Graphs with Independent Crossings\",\"authors\":\"Ke-Jie Li, Xin Zhang\",\"doi\":\"10.1007/s10255-024-1026-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The strong chromatic index of a graph is the minimum number of colors needed in a proper edge coloring so that no edge is adjacent to two edges of the same color. An outerplane graph with independent crossings is a graph embedded in the plane in such a way that all vertices are on the outer face and two pairs of crossing edges share no common end vertex. It is proved that every outerplane graph with independent crossings and maximum degree Δ has strong chromatic index at most 4Δ − 6 if Δ ≥ 4, and at most 8 if Δ ≤ 3. Both bounds are sharp.</p></div>\",\"PeriodicalId\":6951,\"journal\":{\"name\":\"Acta Mathematicae Applicatae Sinica, English Series\",\"volume\":\"40 2\",\"pages\":\"467 - 477\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Mathematicae Applicatae Sinica, English Series\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10255-024-1026-6\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematicae Applicatae Sinica, English Series","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10255-024-1026-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Strong Edge Coloring of Outerplane Graphs with Independent Crossings
The strong chromatic index of a graph is the minimum number of colors needed in a proper edge coloring so that no edge is adjacent to two edges of the same color. An outerplane graph with independent crossings is a graph embedded in the plane in such a way that all vertices are on the outer face and two pairs of crossing edges share no common end vertex. It is proved that every outerplane graph with independent crossings and maximum degree Δ has strong chromatic index at most 4Δ − 6 if Δ ≥ 4, and at most 8 if Δ ≤ 3. Both bounds are sharp.
期刊介绍:
Acta Mathematicae Applicatae Sinica (English Series) is a quarterly journal established by the Chinese Mathematical Society. The journal publishes high quality research papers from all branches of applied mathematics, and particularly welcomes those from partial differential equations, computational mathematics, applied probability, mathematical finance, statistics, dynamical systems, optimization and management science.