Large cycles in 4-connected graphs

Details Large cycles in 4-connected graphs Large cycles in 4-connected graphs

2009-06-27

arxiv.org/abs/0906.5053v1

Mathematics

Combinatorics

4 pages

Scientific paper

Every 4-connected graph $G$ with minimum degree $\delta$ and connectivity
$\kappa$ either contains a cycle of length at least $4\delta-\kappa-4$ or every
longest cycle in $G$ is a dominating cycle.

Affiliated with

Also associated with

No associations

Rating

Large cycles in 4-connected graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large cycles in 4-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large cycles in 4-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306163