# List coloring

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Electr. J. Comb.
- 2016

A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence ofâ€¦Â (More)

Is this relevant?

2013

2013

- CIAC
- 2013

A list assignment of a graph G = (V,E) is a function L that assigns a list L(u) of so-called admissible colors to each u âˆˆ Vâ€¦Â (More)

Is this relevant?

2013

2013

- 2013

In online list coloring (introduced by Zhu and by Schauz in 2009), on each round the set of vertices having a particular color inâ€¦Â (More)

Is this relevant?

2011

2011

- Ars Comb.
- 2011

A new variation of the coloring problem, Î¼-coloring, is defined in this paper. A coloring of a graph G = (V, E) is a function fâ€¦Â (More)

Is this relevant?

2010

2010

- Electr. J. Comb.
- 2010

Let H be a hypergraph and let Lv : v âˆˆ V (H) be sets; we refer to these sets as lists and their elements as colors. A listâ€¦Â (More)

Is this relevant?

2006

2006

- Graphs and Combinatorics
- 2006

Let G = (V , E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that thereâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- VTC--Fall. IEEE 62nd Vehicular Technologyâ€¦
- 2005

The current fixed spectrum allocation scheme leads to low spectrum utilization across the whole spectrum. It requires a moreâ€¦Â (More)

Is this relevant?

2004

2004

- Graphs and Combinatorics
- 2004

A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colorsâ€¦Â (More)

Is this relevant?

2004

2004

- Discrete Mathematics
- 2004

We study an analogue of HajÃ³sâ€™ theorem for list coloring which states that each nonk-choosable graph can be obtained from anyâ€¦Â (More)

Is this relevant?

1996

1996

- Discrete Mathematics
- 1996

DISCRETE MATHEMATICS Discrete Mathematics 152 (1996) 299-302 Communication A Rajos-like theorem for list coloring Sylvain Gravierâ€¦Â (More)

Is this relevant?