Searching for "On the List Colouring Problem." – sorted by Relevance.
-
A Partial Solution of a Partial List Colouring Problem.
- A partial solution of a partial list colouring problem. Jeannette C.M Janssen May 30, 2001
- Add To MetaCart
-
The List Colouring Constants
- this consider the bipartite graph K 3;3 . We consider a list colouring problem with 3 colours, such that each
- Cited by 10 (3 self) – Add To MetaCart
-
On List Colourings and Choosability of Graphs
- a small practical problem is given which motivates the introduction of lists colourings. Assume
- Add To MetaCart
-
List Graph Colouring for Multiple Depot Vehicle Scheduling
- problem as a list-graph colouring problem, denoted L-GCP hereafter. Since graph colouring problems have
- Add To MetaCart
-
A Theorem about the Channel Assignment Problem
- : graph colouring, list{colouring, channel assignment problem Supported in part by the Ministry
- Cited by 24 (7 self) – Add To MetaCart
-
Near-Optimal List Colourings
- the number of uncoloured vertices in C, so we have essentially reduced our problem to a list colouring
- Cited by 1 (0 self) – Add To MetaCart
-
Brooks Type Theorems for Pair-List Colourings and List Homomorphisms
- this result to list colourings. In a list colouring problem, each vertex v of G is equipped with a list L
- Add To MetaCart
-
Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks
- and analysed as a generalised version of the list colouring problem. In the list colouring problem, every
- Cited by 3 (1 self) – Add To MetaCart
-
Deciding k-colourability of P5-free graphs in polynomial time, manuscript
- k and for each vertex v, a list l(v) of k colours, the k-list colouring problem asks whether
- Cited by 1 (0 self) – Add To MetaCart
-
List Homomorphisms and Circular Arc Graphs
- homomorphism of G to H is simply a list colouring of G, and hence L-HOMH is the list colouring problem
- Cited by 20 (5 self) – Add To MetaCart

