Add to ORKGWe prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233--237]
The Andrásfai-Erdős-Sós Theorem [2] states that all triangle-free graphs on n vertices with minim...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
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...
International audienceWe introduce a new method for computing bounds on the independence number and ...
AbstractStaton proved that every triangle-free graph on n vertices with maximum degree 3 has an inde...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
International audienceWe show that every (sub)cubic n-vertex graph with sufficiently large girth has...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
International audienceZykov designed one of the oldest known families of triangle-free graphs with a...
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
International audienceReed conjectured that for every ε>0 and every integer Δ, there exists g such t...
The Andrásfai-Erdős-Sós Theorem [2] states that all triangle-free graphs on n vertices with minim...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
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...
International audienceWe introduce a new method for computing bounds on the independence number and ...
AbstractStaton proved that every triangle-free graph on n vertices with maximum degree 3 has an inde...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
International audienceWe show that every (sub)cubic n-vertex graph with sufficiently large girth has...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
International audienceZykov designed one of the oldest known families of triangle-free graphs with a...
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
International audienceReed conjectured that for every ε>0 and every integer Δ, there exists g such t...
The Andrásfai-Erdős-Sós Theorem [2] states that all triangle-free graphs on n vertices with minim...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...