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   Vol.E74-A   No.7   pp.1915-1917
Publication Date: 1991/07/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs, Networks and Matroids

Full Text: PDF>>
Buy this Article

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.