We study the minimum number of label transitions around a given vertex v 0 in a planar multigraph G , in which the edges incident with v 0 are labelled with integers 1, …, l , and the minimum is taken over all embeddings of G in the plane. For a fixed number of labels, a linear-time fixed-parameter tractable algorithm that computes the minimum number of label transitions around v 0 is presented. If the number of labels is unconstrained, then the problem of deciding whether the minimum number of label transitions is at most k is NP-complete.
展开▼