Searching for "T-choosability in Graphs." – sorted by Relevance.
-
A Partial Solution of a Partial List Colouring Problem.
- Abstract Given a t-choosable graph G on n vertices, and lists of size s t assigned to the vertices of G
- Add To MetaCart

