Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26787
Title: | A Recolouring Problem on Undirected Graphs | Contributor(s): | Kalinowski, Thomas (author) | Publication Date: | 2004 | Open Access: | Yes | Handle Link: | https://hdl.handle.net/1959.11/26787 | Open Access Link: | http://ftp.math.uni-rostock.de/pub/romako/heft58/kali58.pdf | Abstract: | We consider an algorithm on a graph = (, ) with a 2-colouring of , that is motivated from the computer-aided text-recognition. Every vertex changes simultaneously its colour if more than a certain proportion of its neighbours have the other colour. It is shown, that by iterating this algorithm the colouring becomes either constant or 2-periodic. For = ½ the presented theorem is a special case of a known result [1], but here developed independently with another motivation and a new proof. | Publication Type: | Journal Article | Source of Publication: | Rostocker Mathematisches Kolloquium, v.58, p. 27-30 | Publisher: | Universitaet Rostock, Fachbereich Mathematik | Place of Publication: | Germany | ISSN: | 2363-6106 0138-3248 |
Fields of Research (FoR) 2008: | 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal | Publisher/associated links: | http://www.math.uni-rostock.de/math/pub/romako/ |
---|---|
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Description | Size | Format |
---|
Page view(s)
1,314
checked on Mar 7, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.