The number of edges in critical strongly connected graphs

被引：0
|
作者：
Aharoni, R.
Berger, E.
机构：
来源：
| 1600年 / Elsevier Science B.V.卷 / 234期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：1 / 3
相关论文
共 50 条
  • [31] A new lower bound on the number of edges in colour-critical graphs and hypergraphs
    Kostochka, AV
    Stiebitz, M
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 87 (02) : 374 - 402
  • [32] On the minimum number of edges in triangle-free 5-critical graphs
    Postle, Luke
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 264 - 280
  • [33] Split Decomposition of Strongly Connected Graphs
    Joeris, Benson L.
    Lundberg, Scott
    McConnell, Ross M.
    GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 158 - +
  • [34] Strongly proper connected coloring of graphs
    Dębski, Michal
    Grytczuk, Jaroslaw
    Naroski, Pawel
    Śleszyńska-Nowak, Malgorzata
    arXiv, 2023,
  • [35] Independence number and connectivity of maximal connected domination vertex critical graphs
    Almalki, Norah
    Kaemawicharnurat, Pawaton
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2023, 9 (02) : 185 - 196
  • [36] Bounding the number of edges in permutation graphs
    Keevash, P
    Loh, PS
    Sudakov, B
    ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
  • [37] SATURATED GRAPHS WITH MINIMAL NUMBER OF EDGES
    KASZONYI, L
    TUZA, Z
    JOURNAL OF GRAPH THEORY, 1986, 10 (02) : 203 - 210
  • [38] Number of edges in inhomogeneous random graphs
    Zhishui Hu
    Liang Dong
    Science China Mathematics, 2021, 64 : 1321 - 1330
  • [39] On the Extremal Number of Edges in Hamiltonian Graphs
    Ho, Tung-Yang
    Lin, Cheng-Kuan
    Tan, Jimmy J. M.
    Hsu, D. Frank
    Hsu, Lih-Hsing
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2011, 27 (05) : 1659 - 1665
  • [40] Making Bidirected Graphs Strongly Connected
    Tatsuya Matsuoka
    Shun Sato
    Algorithmica, 2020, 82 : 787 - 807
12345