For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Note on Dual Trail Partition of a Plane Graph
Shuichi UENO Katsufumi TSUJI Yoji KAJITANI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/07/25
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs, Networks and Matroids
Full Text: PDF>>
Given a plane graph G, a trail of G is said to be dual if it is also a trail in the geometric dual of G. We show that the problem of partitioning the edges of G into the minimum number of dual trails is NP-hard.