Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:455‐462, 2011

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial designs 2011-11, Vol.19 (6), p.455-462
Hauptverfasser: Smith, Benjamin R., Küçükçifçi, Selda, Yazıcı, Emineşule
Format: Artikel
Sprache:eng
Schlagworte:
ADCT
closed trails
graph decomposition
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:455‐462, 2011
ISSN:1063-8539
1520-6610
DOI:10.1002/jcd.20304