If a graph has a closed walk of length at least three containing a vertex , then has a cycle containing . Can anyone explain why this statement is true or false?
Follow Math Help Forum on Facebook and Google+
Originally Posted by lachicacomica If a graph has a closed walk of length at least three containing a vertex , then has a cycle containing . Can anyone explain why this statement is true or false? Look at the definition of a closed walk and cycle. How do they compare?
View Tag Cloud