Let G = (V (G), E(G)) be a simple graph of maximum degree ∆ ≤ D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) ∪ E(G) such that no adjacent or incident elements of S receive
✦ LIBER ✦
An extension of Barta’s Theorem and geometric applications
✍ Scribed by G. Pacelli Bessa; J. Fábio Montenegro
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 286 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0232-704X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An extension of Vizing's theorem
✍
Chew, K. H.
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 110 KB
An extension of Wagner's theorem
✍
Lynn Margaret Batten
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 215 KB
In his famous 1965 paper, Asher Wagner proves that if S is a finite affine plane and G a collineation group line transitive on S. then S is a translation atfine plane and G contains the translation group of S. In this paper, we generalize Wagner's assumptions to: S is an affine spfce embedded as a m
An extension of Melnikov's theorem
✍
A.M. Davie; D.R. Wilken
📂
Article
📅
1972
🏛
Elsevier Science
🌐
English
⚖ 208 KB
An extension of Polya's Theorem
✍
A.M Fink
📂
Article
📅
1968
🏛
Elsevier Science
🌐
English
⚖ 142 KB
An extension of Schensted's theorem
✍
Curtis Greene
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 588 KB
An extension of Radner's theorem
✍
W. H. Hartman
📂
Article
📅
1974
🏛
Springer
🌐
English
⚖ 478 KB