Decremental optimization of vertex-colouring under the reconfiguration framework

Suppose that we are given a positive integer k, and a k-(vertex-)colouring of a given graph G. Then we are asked to find a colouring of G using the minimum number of colours among colourings that are reachable from by iteratively changing a colour assignment of exactly one vertex while maintaining t...

Full description

Bibliographic Details

Published in:	International journal of computer mathematics. Computer systems theory Vol. 8; no. 1; pp. 80 - 92
Main Authors:	Yanagisawa, Yusuke, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 02.01.2023
Subjects:	Combinatorial reconfiguration graph algorithms graph colouring linear-time algorithms
ISSN:	2379-9927, 2379-9935
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!