Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph

Risultato della ricerca: Contributo in rivistaArticolo in rivistapeer review

3 Citazioni (Scopus)

Abstract

A generalization of the Oberwolfach problem, proposed by Liu (J Comb Des 8:42–49, 2000), asks for a uniform 2-factorization of the complete multipartite graph Km×n. Here we focus our attention on cyclic 2-factorizations, whose 2-factors are disjoint union of cycles all of even length l. In particular, we present a complete solution for the extremal cases l=4 and l=mn.
Lingua originaleEnglish
pagine (da-a)901-930
Numero di pagine30
RivistaGraphs and Combinatorics
Volume34
DOI
Stato di pubblicazionePubblicato - 2018

Keywords

  • 2-factorization
  • Complete multipartite graph
  • Cycle

Fingerprint

Entra nei temi di ricerca di 'Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph'. Insieme formano una fingerprint unica.

Cita questo