Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cartesian products of graphs as spanning subgraphs of de Bruijn graphs ?
 

Summary: Cartesian products of graphs as spanning
subgraphs of de Bruijn graphs ?
(Extended Abstract)
Thomas Andreae 1 , Michael N¨olle 2 , Gerald Schreiber 2
1 Mathematisches Seminar
Universit¨at Hamburg
Bundesstraße 55
D­20146 Hamburg
Germany
2 Technische Universit¨at Hamburg­Harburg
Technische Informatik I
Harburger Schloßstraße 20
D­21071 Hamburg
Germany
To appear in: Proceedings of the 20. Workshop ''Graph­Theoretic
Concepts in Computer Science'', held June 16­18, 1994 in Herrsching
(near Munich, Germany). To be published in Lecture Notes in
Computer Science, Springer.
Abstract. For Cartesian products G = G1 \Theta . . . \Theta Gm (m – 2) of
nontrivial connected graphs G i and the n­dimensional base B de Bruijn

  

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

 

Collections: Computer Technologies and Information Sciences