Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,651,330 papers from all fields of science
Search
Sign In
Create Free Account
List coloring
Known as:
Choosability
, List colouring
, List colorability
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Brooks' theorem
Bruce Reed (mathematician)
Degeneracy (graph theory)
Forbidden graph characterization
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On acyclic 4-choosability of planar graphs without short cycles
Min Chen
,
A. Raspaud
Discrete Mathematics
2010
Corpus ID: 42914398
2010
2010
Planar graphs with maximum degree ? = 9 are ( ? + 1 ) -edge-choosableA short proof
Nathann Cohen
,
F. Havet
2010
Corpus ID: 7129754
We give a short proof of the following theorem due to Borodin [2]. Every planar graph with maximum degree ∆ ≥ 9 is (∆ + 1)-edge…
Expand
2009
2009
Edge choosability of planar graphs without 5-cycles with a chord
Yongzhu Chen
,
Weiyi Zhu
,
Weifan Wang
Discrete Mathematics
2009
Corpus ID: 27509762
2009
2009
An analytic approximation to the cardinal functions of Gaussian radial basis functions on an infinite lattice
J. Boyd
,
Lei Wang
Applied Mathematics and Computation
2009
Corpus ID: 6697335
2007
2007
Vector sensor arrays in DOA estimation for the low angle tracking
Hyochul Kwak
,
Eunjung Yang
,
J. Chun
International Waveform Diversity and Design…
2007
Corpus ID: 1641872
In this paper, we propose a new direction-of-arrival (DOA) scheme using a vector sensor array for the low-angle tracking…
Expand
2006
2006
Edge and Total Choosability of Near-Outerplanar Graphs
Timothy J. Hetherington
,
D. R. Woodall
Electronic Journal of Combinatorics
2006
Corpus ID: 12408390
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…
Expand
2002
2002
A note on planar 5-list colouring: non-extendability at distance 4
Z. Tuza
,
M. Voigt
Discrete Mathematics
2002
Corpus ID: 34461483
2002
2002
Connected and Loosely Connected List Homomorphisms
N. Vikas
International Workshop on Graph-Theoretic…
2002
Corpus ID: 41949860
In this paper, we study a special graph colouring problem, called the list homomorphism problem, which is a generalisation of the…
Expand
1996
1996
List Total Colorings of Graphs
M. Juvan
,
R. Škrekovski
1996
Corpus ID: 12667809
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We…
Expand
1989
1989
Improved addition for the logarithmic number system
H. Henkel
IEEE Transactions on Acoustics Speech and Signal…
1989
Corpus ID: 26615278
The logarithmic number system (LNS), which offers a wide dynamic range with an independently choosable signal-to-noise ratio, is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE