Chromatic number of triangle-free graphs with some forbidden subgraphs

DOI10.11845/SXJZ.2014055BzbMATH Open1340.05182OpenAlexW2567842469MaRDI QIDQ3461265FDOQ3461265

Authors: Xiao Wang 

Publication date: 15 January 2016

Full work available at URL: http://www.oaj.pku.edu.cn/sxjz/EN/10.11845/sxjz.2014055b

Recommendations

• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
• scientific article; zbMATH DE number 6612443
• On chromatic number of graphs without certain induced subgraphs.
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs

zbMATH Keywords

chromatic numbertriangle-free graphforbidden subgraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Triangle-free graphs without forbidden subgraphs
• Triangle-free graphs and forbidden subgraphs
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
• Title not available (Why is that?)
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
• Title not available (Why is that?)

This page was built for publication: Chromatic number of triangle-free graphs with some forbidden subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461265)