## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. ยฉ 1995 John Wiley & Sons, Inc.
โฆ LIBER โฆ
Uniform Coloring of Graph
โ Scribed by Berlov, S.L.
- Book ID
- 121571421
- Publisher
- Springer US
- Year
- 2014
- Tongue
- English
- Weight
- 201 KB
- Volume
- 196
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Coloring graph bundles
โ
Sandi Klavลพar; Bojan Mohar
๐
Article
๐
1995
๐
John Wiley and Sons
๐
English
โ 502 KB
Randomized online graph coloring
โ
Sundar Vishwanathan
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 793 KB
Asymmetric graph coloring games
โ
H. A. Kierstead
๐
Article
๐
2005
๐
John Wiley and Sons
๐
English
โ 151 KB
## Abstract We introduce the (__a,b__)โcoloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat
Interval incidence graph coloring
โ
Janczewski, Robert; Maลafiejska, Anna; Maลafiejski, Michaล
๐
Article
๐
2015
๐
Elsevier Science
๐
English
โ 433 KB
Mixed graph edge coloring
โ
Hanna Furmaลczyk; Adrian Kosowski; Bernard Ries; Paweล ลปyliลski
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 987 KB
Relaxed Coloring of a Graph
โ
Sunanda Bagchi
๐
Article
๐
1998
๐
Springer Japan
๐
English
โ 82 KB