Lower bound for the connectivity of directed Euler tour transformation graphs

被引：0
|
作者：
Li, X.
机构：
来源：
Discrete Mathematics | 1997年 / 163卷 / 1-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] A bound on judicious bipartitions of directed graphs
    Jianfeng Hou
    Huawen Ma
    Xingxing Yu
    Xia Zhang
    Science China(Mathematics), 2020, 63 (02) : 297 - 308
  • [32] Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 529 - 543
  • [33] CONNECTIVITY OF FINITE ANISOTROPIC RANDOM GRAPHS AND DIRECTED-GRAPHS
    COHEN, JE
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1986, 99 : 315 - 330
  • [34] On Linear Secret Sharing for Connectivity in Directed Graphs
    Beimel, Amos
    Paskin, Anat
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2008, 5229 : 172 - +
  • [35] 2-Vertex Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Laura, Luigi
    Parotsidis, Nikos
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 605 - 616
  • [36] Changing Euler Diagram Properties by Edge Transformation of Euler Dual Graphs
    Howse, John
    Rodgers, Peter
    Stapleton, Gem
    2009 IEEE SYMPOSIUM ON VISUAL LANGUAGES AND HUMAN-CENTRIC COMPUTING, PROCEEDINGS, 2009, : 177 - +
  • [37] A note on the cyclic connectivity property of directed graphs
    Tong Chunling
    Lin Xiaohui
    Yang Yuansheng
    Xue Feng
    Jiang Huaping
    UTILITAS MATHEMATICA, 2011, 85 : 327 - 331
  • [38] Preserving Strong Connectivity in Directed Proximity Graphs
    Poonawala, Hasan A.
    Spong, Mark W.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (09) : 4392 - 4404
  • [39] Testing Eulerianity and connectivity in directed sparse graphs
    Orenstein, Yaron
    Ron, Dana
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6390 - 6408
  • [40] 2-Edge Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Laura, Luigi
    Parotsidis, Nikos
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
12345