3211 search results - page 50 / 643 » On the Grundy Number of a Graph |
SIAMDM
2000
13 years 7 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
IPL
2007
13 years 7 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
JGT
2010
13 years 6 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
ARSCOM
2004
13 years 7 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
PARA
2004
Springer
14 years 1 months ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...