Title of article
Spanning spiders and light-splitting switches Original Research Article
Author/Authors
Luisa Gargano، نويسنده , , Mikael Hammar، نويسنده , , Pavol Hell، نويسنده , , Ladislav Stacho، نويسنده , , Ugo Vaccaro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
13
From page
83
To page
95
Abstract
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity.
Keywords
Spanning tree , Branch vertex , Hamilton path
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948980
Link To Document