PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

GRAPHS WITH EVERY PATH OF LENGTH k IN A HAMILTONIAN CYCLE

Content
Title variants
Languages of publication
PL
Abstracts
PL
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + k) : dG(x; y) = 2 ) maxfd(x); d(y)g > n + k 2 for each pair of vertices x and y in G; then any path S G of length k is contained in a hamiltonian cycle of G:
Publisher
Year
-
Physical description
Dates
online
2015-09-30
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-4500
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.