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 条

[31] On the covering graph of balanced lattices
Stern, M
DISCRETE MATHEMATICS, 1996, 156 (1-3) : 311 - 316
[32] On covering a bipartite graph with cycles
Wang, Hong
SIAM Journal on Discrete Mathematics, 2001, 15 (01) : 86 - 96
[33] On the covering graph of balanced lattices
Discrete Math, 1-3 (311):
[34] CONCRETE GRAPH COVERING PROJECTIONS
HOFMEISTER, M
ARS COMBINATORIA, 1991, 32 : 121 - 128
[35] The Average Covering Number of a Graph
Dogan, Derya
Dundar, Pinar
JOURNAL OF APPLIED MATHEMATICS, 2013,
[36] GRAPH ALGORITHMS AND COVERING PROBLEMS
PERL, J
COMPUTING, 1974, 13 (02) : 107 - 113
[37] ON THE GRAPHOIDAL COVERING NUMBER OF A GRAPH
PAKKIAM, C
ARUMUGAM, S
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1989, 20 (04): : 330 - 333
[38] Covering a Graph with Densest Subgraphs
Riccardo Dondi
Alexandru Popa
La Matematica, 2024, 3 (4): : 1360 - 1378
[39] On covering a bipartite graph with cycles
Wang, H
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (01) : 86 - 96
[40] STRONG COVERING OF A BIPARTITE GRAPH
MCWHIRTER, IP
YOUNGER, DH
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1971, 3 (JAN): : 86 - +

← 1 2 3 4 5 →