Premium
A Construction of a perfect set of Euler tours of K 2k+1
Author(s) -
Heinrich K.,
Verrall H.
Publication year - 1997
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/(sici)1520-6610(1997)5:3<215::aid-jcd5>3.0.co;2-i
Subject(s) - euler's formula , corollary , mathematics , conjecture , set (abstract data type) , combinatorics , computer science , mathematical analysis , programming language
In this article we prove Kotzig's Conjecture by constructing a perfect set of Euler tours of K 2 k +1 . As a corollary, we deduce that L ( K 2 k +1 ), the line graph of K 2 k +1 , has a Hamilton decomposition. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 215–230, 1997