Skip to main content
added 1 characters in body
Source Link
Rick
  • 1
  • 1

Is thatDoes each graph of minimum degree three admitsadmit a spanning tree whose vertices have degree three (exactly) except the leaves (degree one)?

Is that each graph of minimum degree three admits a spanning tree whose vertices have degree three except the leaves?

Does each graph of minimum degree three admit a spanning tree whose vertices have degree three (exactly) except the leaves (degree one)?

Source Link
Rick
  • 1
  • 1

spanning tree of a graph of minimum degree three

Is that each graph of minimum degree three admits a spanning tree whose vertices have degree three except the leaves?