THE EDGE RECONSTRUCTION OF HAMILTONIAN GRAPHS

被引：4

|

作者：

PYBER, L

机构：

[1] Mathematical Institute of the Hungarian, Academy of Sciences, Budapest

来源：

JOURNAL OF GRAPH THEORY | 1990年 / 14卷 / 02期

关键词：

D O I：

10.1002/jgt.3190140205

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

If a graph G on n vertices contains a Hamiltonian path, then G is reconstructible from its edge‐deleted subgraphs for n sufficiently large. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

引用

收藏

页码：173 / 179

页数：7

相关论文

共 50 条

[1] ON THE EDGE RECONSTRUCTION OF GRAPHS
YUAN, H
ARS COMBINATORIA, 1988, 25 : 185 - 188
[2] 1-EDGE HAMILTONIAN GRAPHS
LESNIAK, L
BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1975, 23 (12): : 1223 - 1226
[3] Dense graphs and edge reconstruction
Pyber, L
COMBINATORICA, 1996, 16 (04) : 521 - 525
[4] EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS
李明楚
刘振宏
Science Bulletin, 1991, (12) : 1055 - 1056
[5] The strongly k-edge Hamiltonian graphs
Hung, CN
Chen, CH
PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 534 - 537
[6] EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS
LI, MC
LIU, ZH
CHINESE SCIENCE BULLETIN, 1991, 36 (12): : 1055 - 1056
[7] EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS
WAN, HH
UTILITAS MATHEMATICA, 1993, 43 : 245 - 252
[8] ON EDGE-HAMILTONIAN CAYLEY-GRAPHS
BAUMANN, U
DISCRETE APPLIED MATHEMATICS, 1994, 51 (1-2) : 27 - 37
[9] 2 EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS
LI, MC
GRAPHS AND COMBINATORICS, 1994, 10 (02) : 169 - 178
[10] ON EDGE-HAMILTONIAN PROPERTY OF CAYLEY-GRAPHS
CHEN, CC
DISCRETE MATHEMATICS, 1988, 72 (1-3) : 29 - 33

← 1 2 3 4 5 →