{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:10:51Z","timestamp":1697955051780},"reference-count":3,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6798,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A directed graph G with a source s and a sink t is called a p\u2010graph if every edge of G belongs to an elementary (s,t)\u2010path of G. If C is a cycle of the p\u2010graph G then a cyclic cover of C is a set of (s,t)\u2010paths of G that contains all the edges of C. A cyclic cover Q is minimal if for every path P e Q, Q = {P} is not a cover of C. The following property is known and was used in providing an important result in network reliability: A cyclic p\u2010graph has a cycle C and a path P such that P is not contained in any minimal cover of C. In this note we give a simpler proof of this property which provides more insight into the nature of cyclic covers in p\u2010graphs.<\/jats:p>","DOI":"10.1002\/net.3230180107","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T23:20:15Z","timestamp":1178925615000},"page":"51-53","source":"Crossref","is-referenced-by-count":2,"title":["On a property of cyclic covers of <i>p<\/i>\u2010graphs"],"prefix":"10.1002","volume":"18","author":[{"given":"Themistocles","family":"Politof","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1978.5220266"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1982.5221215"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100107"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T20:16:34Z","timestamp":1697919394000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["10.1002\/net.3230180107"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180107","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}