THE NUMBER OF EDGES IN A MAXIMUM GRAPH WITH UNI-LENGTH CYCLES

被引：0

|

作者：

SHI, YB

机构：

来源：

KEXUE TONGBAO | 1988年 / 33卷 / 21期

关键词：

D O I：

暂无

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

收藏

页码：1831 / 1832

页数：2

相关论文

共 50 条

[41] ON THE NUMBER OF EDGES IN THE TRANSITIVE CLOSURE OF A GRAPH
MCCOLL, WF
NOSHITA, K
DISCRETE APPLIED MATHEMATICS, 1986, 15 (01) : 67 - 73
[42] TURANS THEOREM FOR NUMBER OF EDGES OF A GRAPH
MARTINOV, N
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1977, 30 (04): : 479 - 481
[43] NUMBER OF EDGES IN A GRAPH OF A GIVEN RADIUS
VIZING, VG
DOKLADY AKADEMII NAUK SSSR, 1967, 173 (06): : 1245 - &
[44] On the number of vertices and edges of the Buneman graph
A. Dress
M. Hendy
K. Huber
V. Moulton
Annals of Combinatorics, 1997, 1 (1) : 329 - 337
[45] On the maximum number of edges in a hypergraph with given matching number
Frankl, Peter
DISCRETE APPLIED MATHEMATICS, 2017, 216 : 562 - 581
[46] Hamiltonian cycles avoiding sets of edges in a graph
Ferrara, Michael J.
Jacobson, Michael S.
Harlan, Angela K.
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 48 : 191 - 203
[47] ON THE NUMBER OF CYCLES OF SHORT LENGTH IN THE DE BRUIJN-GOOD GRAPH GN
WAN, ZX
XIONG, RH
YU, MA
DISCRETE MATHEMATICS, 1986, 62 (01) : 85 - 98
[48] Maximum number of edges in a preuniquely k-colourable graph with resistive k-colourings
Wentzlau, M.
Journal of Information Processing and Cybernetics, 1992, 28 (06): : 371 - 383
[49] Reducing the maximum degree of a graph by deleting edges
Borg, Peter
Fenech, Kurt
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 73 : 247 - 260
[50] THE NUMBER OF CYCLES IN A HAMILTON GRAPH
SHI, YB
DISCRETE MATHEMATICS, 1994, 133 (1-3) : 249 - 257

← 1 2 3 4 5 →