Hamilton Powers of Eulerian Digraphs

被引：0
|
作者：
Colon, Enrico Celestino [1 ]
Urschel, John [2 ]
机构：
[1] Harvard Univ, Dept Math, Cambridge, MA 02138 USA
[2] MIT, Dept Math, Cambridge, MA USA
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2024年 / 31卷 / 02期
基金：
美国国家科学基金会;
关键词：
D O I：
10.37236/11905
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this note, we prove that the inverted right perpendicular1/2 root n log(2)(2) n inverted left perpendicular(th) power of a connected n-vertex Eulerian digraph is Hamiltonian, and provide an infinite family of digraphs for which the left perpendicular root n/2 right perpendicular(th) power is not.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] Immersion of complete digraphs in Eulerian digraphs
    Girao, Antonio
    Letzter, Shoham
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2024, 260 (01) : 401 - 425
  • [2] RANDOMLY EULERIAN DIGRAPHS
    CHARTRAN.G
    LICK, DR
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (01): : A30 - +
  • [3] RANDOMLY EULERIAN DIGRAPHS
    CHARTRAND, G
    LICK, DR
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1971, 21 (03) : 424 - +
  • [4] DIGRAPHS WITH EULERIAN CHAINS
    SKILTON, DK
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1986, 41 : 298 - 303
  • [5] Delta invariant for Eulerian digraphs
    Chen, Sheng
    Dai, Yi
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 928 : 94 - 103
  • [6] Anti-Eulerian digraphs
    Zhang, Bo
    Wu, Baoyindureng
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2021, 411
  • [7] Reducibility of Eulerian Graphs and Digraphs
    Attar, Akram B.
    [J]. APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2013, 8 (02): : 717 - 732
  • [8] Packing circuits in eulerian digraphs
    Seymour, PD
    [J]. COMBINATORICA, 1996, 16 (02) : 223 - 231
  • [9] The Diameter of Almost Eulerian Digraphs
    Dankelmann, Peter
    Volkmann, L.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [10] On Hamiltonian Powers of Digraphs
    Antoni Marczyk
    [J]. Graphs and Combinatorics, 2000, 16 : 103 - 113
12345