Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free subcubic graph is at most 32 / 11 ≈ 2.909
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
International audienceIn this paper, the total chromatic number and the fractional total chromatic n...
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic gr...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus ...
International audienceWe introduce a new method for computing bounds on the independence number and ...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
The fractional chromatic number of a graph is defined as the optimum of a rather unwieldy linear pro...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chroma...
AbstractZykov designed one of the oldest known families of triangle-free graphs with arbitrarily hig...
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
International audienceIn this paper, the total chromatic number and the fractional total chromatic n...
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic gr...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus ...
International audienceWe introduce a new method for computing bounds on the independence number and ...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
The fractional chromatic number of a graph is defined as the optimum of a rather unwieldy linear pro...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chroma...
AbstractZykov designed one of the oldest known families of triangle-free graphs with arbitrarily hig...
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
International audienceIn this paper, the total chromatic number and the fractional total chromatic n...
DOI
Add to ORKG