Guillermo De Ita Luna, Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge E. Gutiérrez-Gómez
{"title":"平面图形着色的一种启发式算法","authors":"Guillermo De Ita Luna, Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge E. Gutiérrez-Gómez","doi":"10.1016/j.entcs.2020.10.008","DOIUrl":null,"url":null,"abstract":"<div><p>We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set <em>S</em> of the input graph. The maximal independent set <em>S</em> must fulfill certain characteristics. For example, <em>S</em> contains the vertex that appears in a maximum number of odd cycles of <em>G</em>. The construction of <em>S</em> considers the internal-face graph of the input graph <em>G</em> in order to select each vertex belonging to a maximal number of odd faces of <em>G</em>.</p><p>The traversing in pre-order on the internal-face graph <em>G</em><sub><em>f</em></sub> of the input planar graph <em>G</em> provides us of a strategy for the construction of partial maximal independent sets of critical regions of <em>G</em><sub><em>f</em></sub>. Thus, the union of these partial maximal independent sets forms a maximal independent set <em>S</em> of <em>G</em>. This allows us to color first the vertices that are crucial for decomposing <em>G</em> in a graph (<em>G − S</em>), which is a polygonal tree, and therefore, is 3-colorable.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.008","citationCount":"0","resultStr":"{\"title\":\"A Heuristic for the Coloring of Planar Graphs\",\"authors\":\"Guillermo De Ita Luna, Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge E. Gutiérrez-Gómez\",\"doi\":\"10.1016/j.entcs.2020.10.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set <em>S</em> of the input graph. The maximal independent set <em>S</em> must fulfill certain characteristics. For example, <em>S</em> contains the vertex that appears in a maximum number of odd cycles of <em>G</em>. The construction of <em>S</em> considers the internal-face graph of the input graph <em>G</em> in order to select each vertex belonging to a maximal number of odd faces of <em>G</em>.</p><p>The traversing in pre-order on the internal-face graph <em>G</em><sub><em>f</em></sub> of the input planar graph <em>G</em> provides us of a strategy for the construction of partial maximal independent sets of critical regions of <em>G</em><sub><em>f</em></sub>. Thus, the union of these partial maximal independent sets forms a maximal independent set <em>S</em> of <em>G</em>. This allows us to color first the vertices that are crucial for decomposing <em>G</em> in a graph (<em>G − S</em>), which is a polygonal tree, and therefore, is 3-colorable.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.008\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066120300840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066120300840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set S of the input graph. The maximal independent set S must fulfill certain characteristics. For example, S contains the vertex that appears in a maximum number of odd cycles of G. The construction of S considers the internal-face graph of the input graph G in order to select each vertex belonging to a maximal number of odd faces of G.
The traversing in pre-order on the internal-face graph Gf of the input planar graph G provides us of a strategy for the construction of partial maximal independent sets of critical regions of Gf. Thus, the union of these partial maximal independent sets forms a maximal independent set S of G. This allows us to color first the vertices that are crucial for decomposing G in a graph (G − S), which is a polygonal tree, and therefore, is 3-colorable.
期刊介绍：
ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
