What do you think the most powerful theorems of graph theory are in a CS context?
I love graph theory, but I find it's more about a framework for organizing problems, but it can feel thin on solutions.
I'm glad someone else who cares about CS sees the value of graph theory but since it's never been allowed in the "standard" math, much like CS, it's not as focused and distilled as Algebra or Calculus.
What is the "fundamental theorem of graph theory" what is the slogan?