Modelling 3-Coloring of Polygonal Trees via Incremental Satisfiability

A novel method to model the 3-coloring on polygonal tree graphs is presented. This proposal is based on the logical specification of the constraints generated for a valid 3-coloring on polygonal graphs. In order to maintain a polynomial time procedure, the logical constraints are formed in a dinaymi...

Full description

Saved in:
Bibliographic Details
Published inPattern Recognition pp. 93 - 102
Main Authors López-Ramírez, Cristina, De Ita, Guillermo, Neri, Alfredo
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
3-coloring
Graph coloring
Incremental satisfiability problem
Polygonal tree graphs
Online AccessGet full text

Cover

More Information
Summary:A novel method to model the 3-coloring on polygonal tree graphs is presented. This proposal is based on the logical specification of the constraints generated for a valid 3-coloring on polygonal graphs. In order to maintain a polynomial time procedure, the logical constraints are formed in a dinaymic way. At the same time, the graph is traversing in postorder, resulting in a polynomial time instance of the incremental satisfiability problem. This proposal can be extended for considering other polynomial time instances of the 3-coloring problem.
ISBN:9783319921976
3319921975
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-92198-3_10