challenge: What is an alternative characterization of a linear forest in graph theory?
  
  A. A directed graph with vertices of degree 0, 1, or 3
  B. A weighted graph with edges of varying lengths
  C. A cyclic graph with vertices of degree 3 or more
  D. An acyclic and claw-free graph
  Answer: 