On Circular 2-Factorizations of the Complete Tripartite Graph

Dirk Briskorn and Sigrid Knust

No 636, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel from Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre

Abstract: We consider 2-factorizations of the complete tripartite graph K{n;3) where each 2-factor consists of cycles with even length. An additional requirement is related to pairs of edges being consecutive in an arbitrary cycle. For all pairs of edges we require that the three nodes incident to these two edges must be from different partite sets of the tripartite graph. We show that such a 2-factorizations cannot exist if n = 2 or n is odd. Furthermore, we show how to construct such a 2-factorization for all even n with n{2,26,34,58,74}.

Keywords: Graph decomposition; complete tripartite graph; 2-factorization (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/201520/1/manuskript_636.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:cauman:636

Access Statistics for this paper

More papers in Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel from Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().