## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo
Some remarks on good colorations
β Scribed by D de Werra
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 409 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The notion of coloring number of a graph was introduced by P. Erdo s and A. Hajnal in [2] in order to investigate the chromatic number of infinite graphs. For a graph G its coloring number, Col(G) is defined to be the least cardinal } for which there is a well ordering of the vertex set in which eve
## Abstract We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence