Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti
On a conjecture of Fink and Jacobson concerning k-domination and k-dependence
β Scribed by Odile Favaron
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 135 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume
Let C \* n , n=0, 1, ..., \*>&1Γ2 be the ultraspherical (Gegenbauer) polynomials, orthogonal on (&1, 1) with respect to the weight (1&x 2 ) \*&1Γ2 . Denote by `n, k (\*), k=1, ..., [nΓ2] the positive zeros of C \* n enumerated in decreasing order. The problem of finding the ``extremal'' function f f
A conjecture concerning the Crame r Wold device is answered in the negative by giving a Fourier-free, probabilistic proof using only elementary techniques. It is also shown how a geometric idea allows one to interpret the Crame r Wold device as a special case of a more general concept.