A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
From MaRDI portal
Publication:6520680
arXiv2402.04526MaRDI QIDQ6520680
This page was built for publication: A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree