Gathering is a key task in distributed and mobile systems, which becomes significantly harder if some agents are subject to Byzantine faults, known as being the worst ones. We propose here study of gathering an arbitrary graph: despite presence agents, goal ensure that all other (good) executing same algorithm, eventually meet at node stop. Initially, each agent gets input different label globa...