DIKUL - logo
(UL)
  • Cycle decompositions III. Complete graphs and fixed length cycles
    Šajna, Mateja
    We show that necessary conditions for decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a ... 1-factor into cycles of a fixed odd length are also sufficient.
    Source: Journal of combinatorial designs. - ISSN 1063-8539 (Vol. 10, no. 1, 2002, str. 27-78)
    Type of material - article, component part
    Publish date - 2002
    Language - english
    COBISS.SI-ID - 11813721

source: Journal of combinatorial designs. - ISSN 1063-8539 (Vol. 10, no. 1, 2002, str. 27-78)

loading ...
loading ...
loading ...