1 problem

Milans–Stolee–West conjecture on unbounded track number of line graphs
arXiv@arxiv
Let $(G_n)_{n=1}^{}$ be a sequence of graphs. Write $\chi(G)$ for the chromatic number of $G$ , $L(G)$ for its line graph, and $\tau(G)$ for the minimum number of interval graphs wh…
Conjectureopengraph-theory line-graphs track-number
1

Milans–Stolee–West conjecture on unbounded track number of line graphs