‎an  oriented perfect path double cover (oppdc) of a‎ ‎graph $g$ is a collection of directed paths in the symmetric‎ ‎orientation $g_s$ of‎ ‎$g$ such that‎ ‎each arc‎ ‎of $g_s$ lies in exactly one of the paths and each‎ ‎vertex of $g$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎maxov{'a} and ne{v{s}}et{v{r}}il (discrete‎ ‎math‎. ‎276 (2004) 287-294) conjectured that ...

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

Free AccessImportant Keywordshttps://doi.org/10.14220/9783737013444.259SectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack Citations ShareShare onFacebookTwitterLinkedInRedditEmail About Previous chapter Next FiguresReferencesRelatedDetails Download book coverOsnabrücker Studien zur Jüdischen und Christlichen Bibel.Volume 8 1st editionISBN: 978-3-8471-1344-7 eISBN: 978-3-7370-1344-4Hi...