Skip to Main content Skip to Navigation
Theses

Plongement de graphes dans l'hypercube

Abstract : The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Another problem will be treated. It concerns the partitioning of hypercube in vertex-disjoint cycles of even length. We prove that hypercubes of dimension n can be partitioned into k vertex-disjoint cycles of even length if k
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00004683
Contributor : Thèses Imag <>
Submitted on : Monday, February 16, 2004 - 2:17:31 PM
Last modification on : Friday, November 6, 2020 - 4:13:24 AM
Long-term archiving on: : Friday, April 2, 2010 - 8:19:19 PM

Identifiers

  • HAL Id : tel-00004683, version 1

Collections

Citation

Mohamed Kobeissi. Plongement de graphes dans l'hypercube. Modélisation et simulation. Université Joseph-Fourier - Grenoble I, 2001. Français. ⟨tel-00004683⟩

Share

Metrics

Record views

568

Files downloads

643