SUFFICIENT CONDITIONS FOR TRACEABLE GRAPHS

被引：0
|
作者：
AINOUCHE, A [1 ]
机构：
[1] UNIV SCI & TECHNOL HOUARI BOUMED,INST MATH,ALGIERS 16111,ALGERIA
来源：
ARS COMBINATORIA | 1990年 / 29B卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：129 / 142
页数：14
相关论文
共 50 条
  • [21] New sufficient conditions for bipancyclic bipartite graphs
    Abderrezzak, ME
    Flandrin, E
    DISCRETE MATHEMATICS, 2004, 286 (1-2) : 5 - 13
  • [22] Sufficient conditions for fractional [a, b]-deleted graphs
    Zhou, Sizhong
    Zhang, Yuli
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,
  • [23] Sufficient conditions for λ′-optirnality in graphs with girth g
    Balbuena, C
    García-Vázquez, P
    Marcote, X
    JOURNAL OF GRAPH THEORY, 2006, 52 (01) : 73 - 86
  • [24] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [25] Some sufficient conditions on hamilton graphs with toughness
    Cai, Gaixiang
    Yu, Tao
    Xu, Huan
    Yu, Guidong
    FRONTIERS IN COMPUTATIONAL NEUROSCIENCE, 2022, 16
  • [26] On sufficient topological indices conditions for properties of graphs
    Yong Lu
    Qiannan Zhou
    Journal of Combinatorial Optimization, 2021, 41 : 487 - 503
  • [27] Sufficient Conditions for the Global Rigidity of Periodic Graphs
    Kaszanitzky, Viktoria E.
    Kiraly, Csaba
    Schulze, Bernd
    DISCRETE & COMPUTATIONAL GEOMETRY, 2022, 67 (01) : 1 - 16
  • [28] The sufficient conditions for the existence of fractional factors graphs
    Li, Jian-Xing
    Deng, Han-Yuan
    Journal of Natural Science of Hunan Normal University, 2003, 26 (01): : 25 - 28
  • [29] NECESSARY AND SUFFICIENT CONDITIONS FOR UNIT GRAPHS TO BE HAMILTONIAN
    Maimani, H. R.
    Pournaki, M. R.
    Yassemi, S.
    PACIFIC JOURNAL OF MATHEMATICS, 2011, 249 (02) : 419 - 429
  • [30] On sufficient topological indices conditions for properties of graphs
    Lu, Yong
    Zhou, Qiannan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (02) : 487 - 503
12345