Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A note on shortest cycle covers of cubic graphs.

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read Online Read More Add to Saved list
  • Additional Information
    • Abstract:
      Let SCC3( G) be the length of a shortest 3-cycle cover of a bridgeless cubic graph G. It is proved in this note that if G contains no circuit of length 5 (an improvement of Jackson's ( JCTB 1994) result: if G has girth at least 7) and if all 5-circuits of G are disjoint (a new upper bound of SCC3( G) for the special class of graphs). [ABSTRACT FROM AUTHOR]
    • Abstract:
      Copyright of Journal of Graph Theory is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)