Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:42:31.823Z Has data issue: false hasContentIssue false

On certain cycles in graphs

Published online by Cambridge University Press:  20 January 2009

Douglas D. Grant
Affiliation:
Napier CollegeEdinburgh
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We show that every simple graph of order 2r and minimum degree ≧4r/3 has the property that for any partition of its vertex set into 2-subsets, there is a cycle which contains exactly one vertex from each 2-subset. We show that the bound 4r/3 cannot be lowered to r, but conjecture that it can be lowered to r + 1.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1981