Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability

Q2 Mathematics
Guillermo De Ita Luna , Cristina López Ramírez , Meliza González Contreras
{"title":"Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability","authors":"Guillermo De Ita Luna ,&nbsp;Cristina López Ramírez ,&nbsp;Meliza González Contreras","doi":"10.1016/j.endm.2018.07.014","DOIUrl":null,"url":null,"abstract":"<div><p>A novel method to model the problem of 3-coloring on outerplanar graphs is presented. The proposal is based on the specification of the logical constraints for the 3-coloring of an outerplanar graph in a dinaymic way, resulting in a polynomial-time instance of the incremental satisfiability problem. This proposal can be extended to consider other polynomial-time instances of the 3-coloring problem.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.014","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

A novel method to model the problem of 3-coloring on outerplanar graphs is presented. The proposal is based on the specification of the logical constraints for the 3-coloring of an outerplanar graph in a dinaymic way, resulting in a polynomial-time instance of the incremental satisfiability problem. This proposal can be extended to consider other polynomial-time instances of the 3-coloring problem.

基于增量可满足性的外平面图3-着色建模
提出了一种新的外平面图上3-着色问题的建模方法。该方案基于对外平面图三维着色的逻辑约束的二维规范,得到了增量可满足性问题的多项式时间实例。这个建议可以推广到考虑其他多项式时间的3-着色问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics 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 is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, 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.
×
引用
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学术官方微信