arXiv Analytics

Sign in

arXiv:1909.02247 [math.CO]AbstractReferencesReviewsResources

On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs

Medha Dhurandhar

Published 2019-09-05Version 1

Reed Conjecture is open for more than 20 years now. Here we prove that Reed Conjecture is valid for (1) {P4UnionK1, Kite}-free graphs (2) {Chair, Kite}-free graphs (3) {K2UnionK2complement , H}-free graphs and (4) {2K2, M}-free graphs where H and M are graphs on six vertices each. Reed conjecture is still open in general.

Comments: 7 pages
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1706.07906 [math.CO] (Published 2017-06-24)
On Validity of Reed Conjecture for {P_5, Flag^C}-free graphs
arXiv:1602.00922 [math.CO] (Published 2016-02-02)
Rainbow vertex-connection and forbidden subgraphs
arXiv:1610.05616 [math.CO] (Published 2016-10-18)
3-Rainbow index and forbidden subgraphs

Links

Toolbox