๐”– Bobbio Scriptorium
โœฆ   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 (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

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

On 3-colorings of Plane Graphs
โœ Bao-gang Xu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 162 KB