Results 1 to 10 of about 700 (120)
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER [PDF]
The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj +4 more sources
Fractional chromatic number of a random subgraph [PDF]
AbstractIt is well known that a random subgraph of the complete graph has chromatic number w.h.p. Boris Bukh asked whether the same holds for a random subgraph of any ‐chromatic graph, at least in expectation. In this paper it is shown that for every graph, whose fractional chromatic number is at least , the fractional chromatic number of its random ...
Bojan Mohar
exaly +4 more sources
On the fractional chromatic number, the chromatic number, and graph products
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Hong-Gwa Yeh
exaly +3 more sources
Fractional Thue chromatic number of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuding Zhu
exaly +2 more sources
Triangle-free subgraphs with large fractional chromatic number [PDF]
AbstractIt is well known that for any integers k and g, there is a graph with chromatic number at least k and girth at least g. In 1960s, Erdös and Hajnal conjectured that for any k and g, there exists a number h(k,g), such that every graph with chromatic number at least h(k,g) contains a subgraph with chromatic number at least k and girth at least g ...
Bojan Mohar
exaly +3 more sources
Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J I Brown
exaly +3 more sources
The fractional chromatic number, the Hall ratio, and the lexicographic product
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P D Johnson
exaly +2 more sources
Bounding the Fractional Chromatic Number of $K_\Delta$-Free Graphs [PDF]
Comment: 30 pages, revised ...
Katherine Edwards, Andrew D. King
exaly +3 more sources
The fractional chromatic number of the plane [PDF]
20 pages, 10 ...
Daniel W. Cranston, Landon Rabern
openaire +4 more sources
Bears with Hats and Independence Polynomials [PDF]
Consider the following hat guessing game. A bear sits on each vertex of a graph $G$, and a demon puts on each bear a hat colored by one of $h$ colors. Each bear sees only the hat colors of his neighbors.
Václav Blažej +2 more
doaj +1 more source

