Hamiltonian cycles in covering graphs of trees

Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

Hamiltonicity of graphs possessing symmetry has been a popular subject of research, with focus on vertex-transitive graphs, and in particular on Cayley graphs. In this paper, we consider the Hamiltonicity of another class of graphs with symmetry, namely covering graphs of trees. In particular, we study the problem for covering graphs of trees, where the tree is a voltage graph over a cyclic group. Batagelj and Pisanski were first to obtain such a result, in the special case when the voltage assignment is trivial; in that case, the covering graph is simply a Cartesian product of the tree and a cycle. We consider more complex voltage assignments, and extend the results of Batagelj and Pisanski in two different ways; in these cases the covering graphs cannot be expressed as products. We also provide a linear time algorithm to test whether a given assignment satisfies these conditions.

本文言語英語
ホスト出版物のタイトルCombinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings
編集者Xiaofeng Gao, Hongwei Du, Meng Han
出版社Springer Verlag
ページ261-275
ページ数15
ISBN(印刷版)9783319711461
DOI
出版ステータス出版済み - 1 1 2017
イベント11th International Conference on Combinatorial Optimization and Applications, COCOA 2017 - Shanghai, 中国
継続期間: 12 16 201712 18 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10628 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議11th International Conference on Combinatorial Optimization and Applications, COCOA 2017
Country中国
CityShanghai
Period12/16/1712/18/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Hamiltonian cycles in covering graphs of trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル