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 条

[1] PATH LENGTH IN COVERING GRAPH OF A LATTICE
DUFFUS, D
RIVAL, I
DISCRETE MATHEMATICS, 1977, 19 (02) : 139 - 158
[2] Covering the vertices of a graph with cycles of bounded length
Bekkai, Siham
Forge, David
Kouider, Mekkia
DISCRETE MATHEMATICS, 2009, 309 (08) : 1963 - 1966
[3] COVERING THE VERTICES OF A GRAPH BY CYCLES OF PRESCRIBED LENGTH
AMAR, D
FOURNIER, I
GERMA, A
JOURNAL OF GRAPH THEORY, 1989, 13 (03) : 323 - 330
[4] Covering a Graph with Cycles of Length at least 4
Wang, Hong
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
[5] LATTICE COVERING BY SEMICROSSES OF ARM LENGTH 2
SZABO, S
EUROPEAN JOURNAL OF COMBINATORICS, 1991, 12 (03) : 263 - 266
[6] DETERMINATION OF LENGTH OF SHORTEST PATH IN A GRAPH
LITVAK, YI
ZAVARIN, AN
ENGINEERING CYBERNETICS, 1974, 12 (04): : 29 - 32
[7] MAXIMAL LENGTH OF AN ELEMENTARY PATH OF THE DIVISORIAL GRAPH
SAIAS, E
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1992, 315 (05): : 507 - 509
[8] PATH LENGTH COMPUTATIONS ON GRAPH MODELS OF COMPUTATIONS
MARTIN, DF
ESTRIN, G
IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (06) : 530 - &
[9] Shortest path length calculation using graph transformations
Mizoguchi, Y
PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 358 - 361
[10] PATH-SENSITIZED COVERING GRAPH METHOD FOR TECHNOLOGY MAPPING OF COMPLEX GATES
JEONG, JC
KYUNIG, CM
IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (10): : 3057 - 3064

← 1 2 3 4 5 →