Building Hamiltonian circuits and paths in star graphs

被引：0

|

作者：

Akl, S.G.

Duprat, J.

Ferreira, A.

机构：

来源：

| 1994年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] FINDING HAMILTONIAN CIRCUITS IN INTERVAL-GRAPHS
KEIL, JM
INFORMATION PROCESSING LETTERS, 1985, 20 (04) : 201 - 206
[42] NUMBER OF HAMILTONIAN CIRCUITS IN THICKLY EDGED GRAPHS
SHEEHAN, J
WRIGHT, EM
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (06): : A530 - A530
[43] Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
Kijima, Shuji
Tanigawa, Shin-ichi
DISCRETE MATHEMATICS, 2012, 312 (16) : 2466 - 2472
[44] On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs
Loewenstein, Christian
Rautenbach, Dieter
Sotak, Roman
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (01): : 7 - 30
[45] Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey
Curran, SJ
Gallian, JA
DISCRETE MATHEMATICS, 1996, 156 (1-3) : 1 - 18
[46] Hamiltonian (s, t)-paths in solid supergrid graphs
Fatemeh Keshavarz-Kohjerdi
Alireza Bagheri
Computational and Applied Mathematics, 2024, 43
[47] An approximation algorithm for finding long paths in Hamiltonian graphs
Vishwanathan, S
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 50 (02): : 246 - 256
[48] Longest paths and cycles in faulty star graphs
Park, JH
Kim, HC
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (11) : 1286 - 1296
[49] Simple paths of maximum length in star graphs
Zelina, Ioana
Tascu, Ioana
CARPATHIAN JOURNAL OF MATHEMATICS, 2008, 24 (02) : 120 - 125
[50] Hamiltonian (s, t)-paths in solid supergrid graphs
Keshavarz-Kohjerdi, Fatemeh
Bagheri, Alireza
COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (03):

← 1 2 3 4 5 →