Every strongly connected graph is Eulerian. There is a series of lowercase letters (a-z) that contains each three-letter combination exactly once as a continuous substring. For every strongly...

Select all true statements

Extracted text: Every strongly connected graph is Eulerian. There is a series of lowercase letters (a-z) that contains each three-letter combination exactly once as a continuous substring. For every strongly connected graph its symmetrization is 2-connected. If a graph contains a vertex of degree six, then it cannot be planar.