Disjoint cycles and spanning graphs of hypercubes

被引：12

作者：

Kobeissi, M

Mollard, M

机构：

[1] Univ Grenoble 1, Lab IMAG, F-38031 Grenoble, France

[2] CNRS, Lab IMAG, F-38031 Grenoble, France

来源：

DISCRETE MATHEMATICS | 2004年 / 288卷 / 1-3期

关键词：

hypercube; cycles; MD-graphs;

D O I：

10.1016/j.disc.2004.08.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The aim of this paper is to prove that double starlike trees are embedable into hypercubes, which answers an open question posed by Ivan Havel (Casopis Pest. Mat. 109 (1984) 135). For this, a theorem about partitioning the hypercubes into vertex-disjoint cycles of even length is first proved. This theorem is then used to prove that a new family of graphs, the MD-graphs, are embedable into hypercubes. Finally, we prove that the double starlike trees are themselves embedable into the MD-graphs, so are in the hypercubes. (C) 2004 Published by Elsevier B.V.

引用

页码：73 / 87

页数：15

共 7 条

[1]

[Anonymous], CAS PEST MAT

[2]

Berge C., 1974, GRAPHES HYPERGRAPHES

[3] THE STARLIKE TREES WHICH SPAN A HYPERCUBE [J].