Covering Graphs with Directed Paths
碩士 === 國立交通大學 === 應用數學系所 === 97 === In this thesis we study an oriented version of perfect path double cover (PPDC). An oriented perfect path double cover (OPPDC) of a graph G is a collection of oriented paths in the symmetric orientation S(G) of G such that each edge of S(G) lies in exactly one of...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/98529606536829265565 |