Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree

Xiao Wang and Baoyindureng Wu ()
Additional contact information
Xiao Wang: Shangluo University
Baoyindureng Wu: Xinjiang University

Journal of Combinatorial Optimization, 2017, vol. 33, issue 1, No 3, 28-34

Abstract: 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 broom B(m, n) is the tree of order $$m+n$$ m + n obtained from identifying a vertex of degree 1 of the path $$P_m$$ P m with the center of the star $$K_{1,n}$$ K 1 , n . In this note, we prove that every connected, triangle-free and B(m, n)-free graph is $$(m+n-2)$$ ( m + n - 2 ) -colorable as an extension of a result of Randerath and Schiermeyer and a result of Gyárfás, Szemeredi and Tuza. In addition, it is also shown that every connected, triangle-free, $$C_4$$ C 4 -free and T-free graph is $$(p-2)$$ ( p - 2 ) -colorable, where T is a tree of order $$p\ge 4$$ p ≥ 4 and $$T\not \cong K_{1,3}$$ T ≇ K 1 , 3 .

Keywords: Chromatic number; Triangle-free graph; Induced subgraph; Forbidden subgraph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9929-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9929-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9929-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().