REMARKS ON HAMILTONIAN PROPERTIES OF POWERS OF DIGRAPHS

被引:8
|
作者
SCHAAR, G
机构
[1] Bergakademie Freiberg, Freiberg
关键词
D O I
10.1016/0166-218X(94)90107-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the last thirty years many authors were engaged in considering the Hamiltonian behaviour of powers of undirected graphs. Started by Sekanina (1960), the investigations in this field have resulted in a lot of interesting and partly very profound propositions; for instance, the famous theorem of Fleischner (1974) on squares of blocks. The surprising thing is that in the case of directed graphs, however, no result of this kind has been published. In this note it is attempted to illustrate the reasons responsible for that different situation and to make a small first step in considering Hamiltonian properties of powers of digraphs.
引用
收藏
页码:181 / 186
页数:6
相关论文
共 50 条
  • [31] HAMILTONIAN GRAPHS AND DIGRAPHS - PRELIMINARY REPORT
    WRIGHT, EM
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (02): : A261 - A261
  • [32] INFINITE HAMILTONIAN PATHS IN CAYLEY DIGRAPHS
    JUNGREIS, IL
    [J]. DISCRETE MATHEMATICS, 1985, 54 (02) : 167 - 180
  • [33] Some remarks on cycles in graphs and digraphs
    Loebl, M
    Matamala, M
    [J]. DISCRETE MATHEMATICS, 2001, 233 (1-3) : 175 - 182
  • [34] ISOMORPHIC DIGRAPHS FROM POWERS MODULO p
    Deng, Guixin
    Yuan, Pingzhi
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2011, 61 (03) : 771 - 779
  • [35] On the symmetric digraphs from powers modulo n
    Deng, Guixin
    Yuan, Pingzhi
    [J]. DISCRETE MATHEMATICS, 2012, 312 (04) : 720 - 728
  • [36] Isomorphic digraphs from powers modulo p
    Guixin Deng
    Pingzhi Yuan
    [J]. Czechoslovak Mathematical Journal, 2011, 61 : 771 - 779
  • [37] On rainbow hamiltonian-connected graphs and digraphs
    [J]. 2018, Charles Babbage Research Centre (106):
  • [38] Hamiltonian cycles in circulant digraphs with two stripes
    Yang, QF
    Burkard, RE
    Cela, E
    Woeginger, GJ
    [J]. DISCRETE MATHEMATICS, 1997, 176 (1-3) : 233 - 254
  • [39] COMPETITION GRAPHS OF STRONGLY CONNECTED AND HAMILTONIAN DIGRAPHS
    FRAUGHNAUGH, KF
    LUNDGREN, JR
    MERZ, SK
    MAYBEE, JS
    PULLMAN, NJ
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (02) : 179 - 185
  • [40] On the size of maximally non-hamiltonian digraphs
    Lichiardopol, Nicolas
    Zamfirescu, Carol T.
    [J]. ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (01) : 59 - 66