The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 6113 of Mathematical Reviews Vol. , Issue 98J
[page]
1998
Mathematical Reviews
Preserved Fulltext
|Stahl, Saul] (1-KS; Lawrence, KS)
Multichromatic numbers, star chromatic numbers and Kneser graphs. (English summary)
J. Graph Theory 26 (1997), no. 3, 137-145. ...
Motivated by the fact that multichromatic and chromatic numbers of Kneser graphs have received much attention, the authors in this paper initiate a study of star chromatic numbers of these graphs. ...
Author index to volume 185 (1998)
1998
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Sali (1-3) 279-285Stahl, S., The multichromatic numbers of some Kneser graphs (Note) ...
Henning, Star-path bipartite Ramsey numbers (Note) , S., On the fractional chromatic number and the lexicographic product of graphs (Note) X., Nonexistence of extremal doubly even self-dual codes with ...
doi:10.1016/s0012-365x(97)83693-x
fatcat:7yqcfj5cbnhuliexhj7vpbze6y
On the locating chromatic number of Kneser graphs
2011
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The minimum number of colors needed in a locating coloring of G is the locating chromatic number of G, denoted by χ L (G). In this paper, we study the locating chromatic number of Kneser graphs. ...
Moreover, we present some bounds for the locating chromatic number of odd graphs. ...
For example, the circular chromatic number, the b-chromatic number and the multichromatic number of Kneser graphs were investigated in [8, 10, 17] , respectively. ...
doi:10.1016/j.dam.2011.07.015
fatcat:khz4fsycd5dcnlehhjw7ku2ite
On the locating chromatic number of Kneser graphs
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1104.3097v1 fatcat:3x5g2nnsbjcrjjd4lhij7jonri
The minimum number of colors needed in a locating coloring of G is the locating chromatic number of G, denoted by __L(G). In this paper, we study the locating chromatic number of Kneser graphs. ...
Moreover, we present some bounds for the locating chromatic number of odd graphs. ...
For example, the circular chromatic number, the b-chromatic number and the multichromatic number of Kneser graphs were investigated in [7] , [9] and [17] , respectively. ...
arXiv:1104.3097v2
fatcat:mgugskfdvbdovjch76igrutrwm
Resource-sharing system scheduling and circular chromatic number
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the study of circular chromatic number, Bondy and Hell defined (p, q)-colorings and also formulated it as a graph homomorphism problem. ...
G is equal to the reciprocal of the fractional chromatic number of G. ...
Indeed, the Kneser graph K(3k, k) has chromatic number k + 2, and hence has circular chromatic number c (K(3k, k)) > k + 1 (it was conjectured [20] that c (K(p, q)) = (K(p, q)) for any p, q and the conjecture ...
doi:10.1016/j.tcs.2004.12.005
fatcat:blzje433czbbdnntagu5w7juxe
Master index of volumes 181–190
1998
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Balaji, Characterisation of selfcomplementary chordal graphs (Note) 188 (1998) Stahl, S., The multichromatic numbers of some Kneser graphs (Note) 185 (1998) Steffen, E., Classifications and characterizations ...
Henning, Star-path bipartite Ram-
sey numbers (Note)
185 (1998)
Hauge, E.R. and J. ...
doi:10.1016/s0012-365x(98)90328-4
fatcat:s2tsivncvfcilf6jlbl4fx24zq
An Application of Stahl's Conjecture About the k-Tuple Chromatic Numbers of Kneser Graphs
[chapter]
Studies in Choice and Welfare
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The value of the k-tuple chromatic number of the Kneser Graph is the subject of a 30-year-old conjecture of Saul Stahl. ...
Mahadev about the relation between the n-tuple chromatic number of a graph and n times the size of its largest clique. * Dedication by Fred Roberts: This paper is dedicated to Peter Fishburn. ...
He is indebted to the late Svata Poljak for his insights and ideas that form the basis for many of the results in this paper. ...
doi:10.1007/978-3-540-79128-7_20
fatcat:qoauih7n7fdrxdu27jutno6rmi
Page 154 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
C.; Stahl, Saul) Multichromatic numbers, star chromatic numbers and Kneser graphs. (English summary) 98j:05067
Johnson, P. D., Jr. see Hilton, A. J. ...
., 98h:05077
Sopena, Eric The chromatic number of oriented graphs. (English summary) 98¢:05069
Stahl, Saul The multichromatic numbers of some Kneser graphs. ...
Page 1580 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Multichromatic numbers, star chromatic numbers and Kneser graphs. (English summary) J. Graph Theory 26 (1997), no. 3, 137-145. (Sheshayya A. ...
Choudum) 98j:05067 05C15
— The multichromatic numbers of some Kneser graphs. (English summary) Discrete Math 185 (1998), no. 1-3, 287-291. ...
Overlap and fractional graph colouring
2009
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this thesis, we investigate the colouring of certain families of graphs. ...
Although a considerable body of material exists concerning the colouring of graphs, there is much less on overlap colourings. ...
This gives rise to the concept of circular, or star, chromatic number (see [12] , [19] , [24] , [29] ). ...
doi:10.21954/ou.ro.0000ed31
fatcat:slmnht4p45dy5e5yumffjcdevm