The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
Sign Up to like & getrecommendations! Published in 2020 at "Aequationes mathematicae"
DOI: 10.1007/s00010-020-00760-z
Abstract: The Gárfás–Sumner conjecture asks whether for every tree T , the class of (induced) T -free graphs is $$\chi $$ χ -bounded. The conjecture is solved for several special trees, but it is still open… read more here.
Keywords: triangle free; free graphs; number; graph ... See more keywords
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9929-z
Abstract: Gyárfás conjectured that for a given forest F, there exists an integer function f(F, x) such that $$\chi (G)\le f(F,\omega (G))$$χ(G)≤f(F,ω(G)) for each F-free graph G, where $$\omega (G)$$ω(G) is the clique number of G. The… read more here.
Keywords: triangle free; free graph; upper bounds; free free ... See more keywords