Color-reversal by local complementation (Q1820800): Difference between revisions

A graph is said to be bicoloured if its vertices are coloured with two distinct colours. A local inversion at a vertex v of a connected bicoloured graph G is an operation on G which reverses the colours of the neighbours of v as well as the adjacency of the subgraph of G induced by the neighbours of v. As pointed out by the author, the notion of local inversion is a modification of another one which arises in an analysis of the fine structure of Eulerian walks studied in his paper ''Eulerian walks and local complementation'' - to appear in Eur. J. Comb. The following theorem is proved: Let G be a connected bicoloured graph of order \(n\geq 2\). Then G can be colour-reversed by taking at most \(6n+3\) local inversions. More generally, given two arbitrary bicolourations \(\beta\) and \(\beta\) ' of G, then \(\beta\) ' can be obtained from \(\beta\) by taking at most 9n local inversions.