Sciweavers

721 search results - page 10 / 145
» Bounds on the k-domination number of a graph
Sort
View
DISOPT
2008
55views more  DISOPT 2008»
14 years 9 months ago
A sequential elimination algorithm for computing bounds on the clique number of a graph
Bernard Gendron, Alain Hertz, Patrick St-Louis
COMBINATORICS
2006
134views more  COMBINATORICS 2006»
14 years 9 months ago
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers
János Pach, Dömötör Pá...
63
Voted
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
14 years 9 months ago
A New Upper Bound on the Total Domination Number of a Graph
Michael A. Henning, Anders Yeo
89
Voted
DM
2002
116views more  DM 2002»
14 years 9 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...