Chromatic number and subtrees of graphs
From MaRDI portal
Publication:1692708
DOI10.1007/s11464-016-0613-0zbMath1421.05046OpenAlexW2558609655MaRDI QIDQ1692708
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
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