๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph Union and Chromatic Number

โœ Scribed by Dirac, G. A.


Book ID
120098301
Publisher
Oxford University Press
Year
1964
Tongue
English
Weight
101 KB
Volume
s1-39
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Circular Chromatic Numbers and Fractiona
โœ G.J. Chang; L. Huang; X. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Rank and chromatic number of a graph
โœ Kotlov, Andrei? ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 105 KB ๐Ÿ‘ 2 views

It was proved (A. Kotlov and L. Lovรกsz, The rank and size of graphs, J. Graph Theory 23 (1996), 185-189) that the number of vertices in a twin-free graph is O(( โˆš 2) r ) where r is the rank of the adjacency matrix. This bound was shown to be tight. We show that the chromatic number of a graph is o(โˆ†

Asteroidal Chromatic Number of a Graph
โœ S. Arumugam; Hepzibai Jeyakumar ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB