PATH LENGTH IN COVERING GRAPH OF A LATTICE

被引：0
|
作者：
DUFFUS, D [1 ]
RIVAL, I [1 ]
机构：
[1] UNIV CALGARY,CALGARY,ALBERTA,CANADA
来源：
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY | 1976年 / 23卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：A357 / A357
页数：1
相关论文
共 50 条
  • [41] An overview of graph covering and partitioning
    Schwartz, Stephan
    DISCRETE MATHEMATICS, 2022, 345 (08)
  • [42] COVERING THE EDGES OF A GRAPH BY CIRCUITS
    KESELMAN, DY
    CYBERNETICS, 1987, 23 (03): : 306 - 313
  • [43] COVERING A GRAPH BY FORESTS AND A MATCHING
    Kaiser, Tomas
    Montassier, Mickaeel
    Raspaud, Andre
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (04) : 1804 - 1811
  • [44] On some covering graphs of a graph
    Pirzada, Shariefuddin
    Ganie, Hilal A.
    Siddique, Merajuddin
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2016, 4 (02) : 132 - 147
  • [45] COVERING THE COMPLETE GRAPH BY PARTITIONS
    FUREDI, Z
    DISCRETE MATHEMATICS, 1989, 75 (1-3) : 217 - 226
  • [46] The chromatic covering number of a graph
    Naserasr, R
    Tardif, C
    JOURNAL OF GRAPH THEORY, 2006, 51 (03) : 199 - 204
  • [47] COVERING THE CLIQUES OF A GRAPH WITH VERTICES
    ERDOS, P
    GALLAI, T
    TUZA, Z
    DISCRETE MATHEMATICS, 1992, 108 (1-3) : 279 - 289
  • [48] On covering vertices of a graph by trees
    Horak, P.
    McAvaney, K.
    DISCRETE MATHEMATICS, 2008, 308 (19) : 4414 - 4418
  • [49] COVERING ALL CLIQUES OF A GRAPH
    TUZA, Z
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 117 - 126
  • [50] Covering the edges of a graph with triangles
    Bujtas, Csilla
    Davoodi, Akbar
    Ding, Laihao
    Gyori, Ervin
    Tuza, Zsolt
    Yang, Donglei
    DISCRETE MATHEMATICS, 2025, 348 (01)
12345