Cycle lengths in polytopal graphs
Cycle lengths in polytopal graphs
复制标题
多面图中的循环长度
DOI:
10.1007/bfb0070393
复制
发表时间:
1978
期刊:
影响因子:
--
通讯作者:
J. Malkevitch
中科院分区:
文献类型:
--
作者:
J. Malkevitch
If G is a hamiltonian 3-polytopal graph with n vertices, G will be called almost pancyclic of order m (m ≥ 3, m < n) if G has cycles of all lengths other than m. Some constructions are given for 3-valent 3-polytopal graphs which are almost pancyclic of order m, and some related results and problems are discussed.