Sciweavers

95 search results - page 2 / 19
» Hamiltonian-Laceability of Star Graphs
Sort
View
TPDS
1998
62views more  TPDS 1998»
15 years 9 days ago
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
Chi-Hsiang Yeh, Emmanouel A. Varvarigos
119
Voted
CORR
2011
Springer
184views Education» more  CORR 2011»
14 years 7 months ago
Acyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
Andrew Lyons
84
Voted
TCS
2010
14 years 11 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
108
Voted
DM
2006
121views more  DM 2006»
15 years 20 days ago
The acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
Alexandre Pinlou, Eric Sopena
GC
2010
Springer
14 years 11 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu