PL EN


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

CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH

Content
Title variants
Languages of publication
PL
Abstracts
PL
The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfying 2 > (4n - 4s - 3) / 3 ; then every matching of G lies on a cycle of length at least n-s and hence, in a path of length at least n - s + 1:
Publisher
Year
-
Physical description
Dates
online
2015-04-09
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-1611
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.