Chromatic number and subtrees of graphs

DOI10.1007/s11464-016-0613-0zbMath1421.05046OpenAlexW2558609655MaRDI QIDQ1692708

Yingli Zhang, Bao-Gang Xu

Publication date: 10 January 2018

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-016-0613-0

zbMATH Keywords

subdivisionchromatic numberclique numberinduced treeGyárfás-Sumner Conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitution and \(\chi\)-boundedness
• The strong perfect graph theorem
• Induced subtrees in graphs of large chromatic number
• Graph Theory and Probability
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• Sur le coloriage des graphs

This page was built for publication: Chromatic number and subtrees of graphs