Skip to search formSkip to main contentSkip to account menu

List coloring

Known as: Choosability, List colouring, List colorability 
In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We give a short proof of the following theorem due to Borodin [2]. Every planar graph with maximum degree ∆ ≥ 9 is (∆ + 1)-edge… 
2007
2007
In this paper, we propose a new direction-of-arrival (DOA) scheme using a vector sensor array for the low-angle tracking… 
2006
2006
It is proved that, if $G$ is a $K_4$-minor-free graph with maximum degree $\Delta \ge 4$, then $G$ is totally $(\Delta+1… 
2002
2002
In this paper, we study a special graph colouring problem, called the list homomorphism problem, which is a generalisation of the… 
1996
1996
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We… 
1989
1989
The logarithmic number system (LNS), which offers a wide dynamic range with an independently choosable signal-to-noise ratio, is…