# Characterization of forbidden subgraphs for bounded star chromatic number

@article{Choi2019CharacterizationOF,
title={Characterization of forbidden subgraphs for bounded star chromatic number},
author={Ilkyoo Choi and Ringi Kim and Boram Park},
journal={Discret. Math.},
year={2019},
volume={342},
pages={635-642}
}
• Published 4 December 2018
• Mathematics
• Discret. Math.
2 Citations

## Figures from this paper

Ramsey-type problems on induced covers and induced partitions toward the Gy\'{a}rf\'{a}s-Sumner conjecture
• Mathematics
• 2022
Gy´arf´as and Sumner independently conjectured that for every tree T , there exists a function f T : N → N such that every T -free graph G satisﬁes χ ( G ) ≤ f T ( ω ( G )), where χ ( G ) and ω ( G )
Graph clustering via generalized colorings
• Mathematics
Theor. Comput. Sci.
• 2022

## References

SHOWING 1-10 OF 23 REFERENCES
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths
• Mathematics
Electron. J. Comb.
• 2017
It is proved that for all nonnegative integers k,s there exists c with the following property: for every vertex-colouring (not necessarily optimal) of G, some induced subgraph of G is an s-vertex path, and all its vertices have different colours.
The Strong Perfect Graph Theorem
• Mathematics
• 2002
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of
Acyclic colorings of planar graphs
A coloring of the vertices of a graph byk colors is called acyclic provided that no circuit is bichromatic. We prove that every planar graph has an acyclic coloring with nine colors, and conjecture
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Mathematics
J. Graph Theory
• 2019
The Gyarfas-Sumner conjecture is proved for two families of trees which do not have this restriction, and as special cases, these families contain all double-ended brooms and two-legged caterpillars.
Induced trees in graphs of large chromatic number
A ‘topological’ version of the conjecture is proved: for every tree T and integer k there is g g such that every graph G with χ(G) > g(k, T ) contains either Kk or an induced copy of a subdivision of T.
Radius two trees specify χ-bounded classes
• Mathematics
J. Graph Theory
• 1994
It is shown that for every tree T, the class of graphs that do not induce T is χ-bounded, and this is true in the case where T is a tree of radius two.
Radius Three Trees in Graphs with Large Chromatic Number
• Mathematics
SIAM J. Discret. Math.
• 2004
The work of several authors is used to show that the conjecture that, for any tree T, the class T, consisting of graphs that do not contain T as an induced subgraph, is $\chi$-bounded is true.