Distance Between α-Orientations of Plane Graphs by Facial Cycle Reversals
- 4 Downloads
Cycle reversal had been shown as a powerful method to deal with the relation among orientations of a graph since it preserves the out-degree of each vertex and the connectivity of the orientations. A facial cycle reversal on an orientation of a plane graph is an operation that reverses all the directions of the edges of a directed facial cycle. An orientation of a graph is called an α- orientation if each vertex admits a prescribed out-degree. In this paper, we give an explicit formula for the minimum number of the facial cycle reversals needed to transform one α-orientation into another for plane graphs.
Keywordsα-Orientation facial cycle reversal distance plane graph
MR(2010) Subject Classification05C10 05C76 05C12
Unable to display preview. Download preview PDF.
The authors would like to thank the anonymous reviewers for their constructive comments and suggestions.
- Knauer, K. B.: Partial orders on orientations via cycle flips [Ph.D thesis], Technische Universität Berlin, Berlin, 2007Google Scholar
- Zhang, W. J., Qian, J. G., Zhang, F. J.: Flip-distance between a-orientations of graphs embedded on plane and sphere. J. Xiamen Univ. (Natural Science), to appearGoogle Scholar