547 search results - page 59 / 110 » dm 2008 |
107
click to vote
DM
1999
15 years 4 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
122
click to vote
DM
1999
15 years 4 months ago
1999
We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur
120
click to vote
DM
2006
15 years 4 months ago
2006
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
130
click to vote
DM
2007
15 years 4 months ago
2007
In this paper, we obtain some new results R(5, 12) 848, R(5, 14) 1461, etc., and we obtain new upper bound formulas for Ramsey numbers with parameters. © 2006 Published by Elsevi...
122
click to vote
DM
2007
15 years 4 months ago
2007
For a tree T and an integer k ≥ 1, it is well known that the k-th power T k of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we...