Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.014

Guillermo De Ita Luna , Cristina López Ramírez , Meliza González Contreras

引用次数: 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 Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

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