The parity hamiltonian cycle problem in directed graphs

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

1 被引用数 (Scopus)

抄録

This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).

本文言語英語
ホスト出版物のタイトルCombinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers
編集者Satoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli
出版社Springer Verlag
ページ50-58
ページ数9
ISBN(印刷版)9783319455860
DOI
出版ステータス出版済み - 1 1 2016
イベント4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, イタリア
継続期間: 5 16 20165 18 2016

出版物シリーズ

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

その他

その他4th International Symposium on Combinatorial Optimization, ISCO 2016
Countryイタリア
CityVietri sul Mare
Period5/16/165/18/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「The parity hamiltonian cycle problem in directed graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル