A note on odd/even cycles

  • Anna Lubiw
  • Published 1988 in Discrete Applied Mathematics


A cycle in a digraph must, of course, be dnected. A cycle is odd (even) if its length-i.e. its number of edges-is odd (even). A cycle m a graph or drgraph 1s chordless if its length is greater than 3 and no two of its vertices are jomed by an edge of the (di)graph which does not belong to the cycle. The first problem may be relevant to the recognition of… (More)
DOI: 10.1016/0166-218X(88)90125-4


1 Figure or Table

Slides referencing similar topics