Skip to main menu
Scroll to content
PL
|
EN
Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit
https://bibliotekanauki.pl
Search
Browse
About
test
PL
EN
BibTeX
PN-ISO 690:2012
Chicago
Chicago (Author-Date)
Harvard
ACS
ACS (no art. title)
IEEE
Preferences
Polski
English
Language
enabled
[disable]
Abstract
10
20
50
100
Number of results
Tools
PL
EN
BibTeX
PN-ISO 690:2012
Chicago
Chicago (Author-Date)
Harvard
ACS
ACS (no art. title)
IEEE
Link to site
Copy
Journal
Czasopismo Techniczne
-
|
Article title
CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH
Authors
GRZEGORZ GANCARZEWICZ
Content
Full texts:
Download
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:
Keywords
PL
cycle, graph, hamiltonian cycle, hamiltonian path, matching, path
Publisher
[unknown2]
Journal
Czasopismo Techniczne
Year
-
Physical description
Dates
online
2015-04-09
Contributors
author
GRZEGORZ GANCARZEWICZ
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.