A (k, 1)-coloring of a graph is a vertex-coloring with k colors such that each vertex is permitted at most 1 neighbor of the same color. We show that every planar graph has at least c n distinct (4, 1)-colorings, where c is constant and โ 1.466 satisfies 3 = 2 +1. On the other hand for any >0, we gi
โฆ LIBER โฆ
Extremal results on defective colorings of graphs
โ Scribed by Marietjie Frick; Michael A. Henning
- Book ID
- 103060524
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 534 KB
- Volume
- 126
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The number of defective colorings of gra
โ
Tom Rackham
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 99 KB
๐ 1 views
A note on defective colorings of graphs
โ
Dan Archdeacon
๐
Article
๐
1987
๐
John Wiley and Sons
๐
English
โ 139 KB
๐ 2 views
A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve
On Total Colorings of Graphs
โ
C. Mcdiarmid; B. Reed
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 299 KB
AND Bruce Reed Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, Canada
Defective colorings of graphs in surface
โ
L. J. Cowen; R. H. Cowen; D. R. Woodall
๐
Article
๐
1986
๐
John Wiley and Sons
๐
English
โ 388 KB
On 3-colorings of Plane Graphs
โ
Bao-gang Xu
๐
Article
๐
2004
๐
Institute of Applied Mathematics, Chinese Academy
๐
English
โ 162 KB
On the colorings of outerplanar graphs
โ
Weifan Wang
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 601 KB