On oriented path double covers

Citations of this article
Mendeley users who have this article in their library.


In this paper we concentrate on 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 GS of G such that each edge of GS lies in exactly one of the paths and for each vertex v of G there is a unique path which begins in v (and thus the same holds also for terminal vertices of the paths). First we show that the graphs K3 and K5 have no OPPDC. Then we study the structure of a minimal connected graph G ≠ K3, G ≠ K5 which has no OPPDC either. We show that the minimal degree in this graph is at least 4. © 2001 Elsevier Science B.V. All rights reserved.




Maxová, J., & Nešetřil, J. (2001). On oriented path double covers. Discrete Mathematics, 233(1–3), 371–380. https://doi.org/10.1016/S0012-365X(00)00253-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free