|
|||||
|
|
Graphs with Hamiltonian cycles having adjacent lines different colors |
|
| Authors: | CC Chen DE Daykin |
| Institution: | Department of Mathematics, University of Reading, Whiteknights, Reading, Berkshire, England |
| Abstract: | Let G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so that no point is on more than k lines of the same color. If p ≥ 17k (or m ≥ 25k) then G has a cycle of every possible size with adjacent lines different colors. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |