RANDOMLY EULERIAN DIGRAPHS

被引：0
|
作者：
CHARTRAND, G
LICK, DR
机构：
来源：
CZECHOSLOVAK MATHEMATICAL JOURNAL | 1971年 / 21卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：424 / +
页数：1
相关论文
共 50 条
  • [1] RANDOMLY EULERIAN DIGRAPHS
    CHARTRAN.G
    LICK, DR
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (01): : A30 - +
  • [2] Immersion of complete digraphs in Eulerian digraphs
    Girao, Antonio
    Letzter, Shoham
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2024, 260 (01) : 401 - 425
  • [3] DIGRAPHS WITH EULERIAN CHAINS
    SKILTON, DK
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1986, 41 : 298 - 303
  • [4] RANDOMLY ANTITRACEABLE DIGRAPHS
    FINK, JF
    [J]. JOURNAL OF GRAPH THEORY, 1982, 6 (04) : 481 - 488
  • [5] Hamilton Powers of Eulerian Digraphs
    Colon, Enrico Celestino
    Urschel, John
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (02):
  • [6] Delta invariant for Eulerian digraphs
    Chen, Sheng
    Dai, Yi
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 928 : 94 - 103
  • [7] Anti-Eulerian digraphs
    Zhang, Bo
    Wu, Baoyindureng
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2021, 411
  • [8] Reducibility of Eulerian Graphs and Digraphs
    Attar, Akram B.
    [J]. APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2013, 8 (02): : 717 - 732
  • [9] Packing circuits in eulerian digraphs
    Seymour, PD
    [J]. COMBINATORICA, 1996, 16 (02) : 223 - 231
  • [10] The Diameter of Almost Eulerian Digraphs
    Dankelmann, Peter
    Volkmann, L.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
12345