2m-cycle systems of K2m+1/C-m


Autoria(s): Bryant, DE
Data(s)

01/01/1997

Resumo

For all m greater than or equal to 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.

Identificador

http://espace.library.uq.edu.au/view/UQ:57897

Idioma(s)

eng

Palavras-Chave #Mathematics
Tipo

Journal Article