The Gateway to Computer Science Excellence
0 votes
Suppose that G contains a cycle C, and a path of length at least k between some two
vertices of C. Show that G contains a cycle of length at least āˆšk.
in Graph Theory by Junior
edited by | 84 views

Couldn't solve this in the exam šŸ˜¶ Looked up online and found this :  

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,223 questions
59,811 answers
118,087 users