Premium
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
Author(s) -
Smith Benjamin R.,
Küçükçifçi Selda,
Yazıcı Emineşule
Publication year - 2011
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20304
Subject(s) - multipartite , mathematics , combinatorics , graph , discrete mathematics , physics , quantum mechanics , quantum entanglement , quantum
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom