Basit öğe kaydını göster

FACTORIZATIONS OF COMPLETE GRAPHS INTO CYCLES AND 1-FACTORS

dc.contributor.authorOdabasi, Ugur
dc.date.accessioned2021-03-03T17:04:36Z
dc.date.available2021-03-03T17:04:36Z
dc.date.issued2020
dc.identifier.citationOdabasi U., "FACTORIZATIONS OF COMPLETE GRAPHS INTO CYCLES AND 1-FACTORS", CONTRIBUTIONS TO DISCRETE MATHEMATICS, cilt.15, sa.1, ss.80-89, 2020
dc.identifier.issn1715-0868
dc.identifier.othervv_1032021
dc.identifier.otherav_47d4d1e3-5d8e-481a-bfa0-07fcdf076fa5
dc.identifier.urihttp://hdl.handle.net/20.500.12627/51807
dc.description.abstractIn this paper, we consider factorizations of complete graph K-v into cycles and 1-factors. We will focus on the existence of factorizations of K-v containing two nonisomorphic factors. We obtain all possible solutions for uniform factors involving m-cycles and 1-factors with a few possible exceptions when m is odd.
dc.language.isoeng
dc.subjectMatematik
dc.subjectTemel Bilimler (SCI)
dc.titleFACTORIZATIONS OF COMPLETE GRAPHS INTO CYCLES AND 1-FACTORS
dc.typeMakale
dc.relation.journalCONTRIBUTIONS TO DISCRETE MATHEMATICS
dc.contributor.departmentİstanbul Üniversitesi , ,
dc.identifier.volume15
dc.identifier.issue1
dc.identifier.startpage80
dc.identifier.endpage89
dc.contributor.firstauthorID2275948


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster