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
Extremal spectral radius of K3,3/K2,4-minor free graphs
Sign Up to like & getrecommendations! Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2021.07.003
Abstract: Abstract Let ρ ⁎ ( s , t ) be the largest real root of the quadratic equation: ( x − s + 2 ) ( x − t + 1 ) − ( n… read more here.
Keywords: minor free; graph order; spectral radius; large enough ... See more keywords
The Independence Number Conditions for 2-Factors of a Claw-Free Graph
Sign Up to like & getrecommendations! Published in 2022 at "Axioms"
DOI: 10.3390/axioms11080417
Abstract: In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs. If a nontrivial path contains only internal vertices of degree two… read more here.
Keywords: claw free; independence number; branch; free graph ... See more keywords