Karthick's star-chi-boundedness conjecture for claw-free graphs
Statement
For a graph , the star chromatic number is the minimum number of colors in a proper coloring such that any two color classes induce a star forest. A graph is -free if it has no induced subgraph isomorphic to . Karthick's conjecture. The class of all -free graphs, where , is -bounded.
This conjecture concerns star colorings under a natural forbidden-induced-subgraph condition. The supplied text gives no resolution status, while noting that Karthick introduced the notion of -boundedness and proposed this conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.