Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Review

2018

Review

2018

We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin’s… Expand

Is this relevant?

2010

2010

The four-color problem was a main driving force for the development of graph theory as we know it today, and coloring is still a… Expand

Is this relevant?

2010

2010

Galvin solved the Dinitz conjecture by proving that bipartite graphs are edge-choosable. We improve Galvin’s method and deduce… Expand

Is this relevant?

2002

2002

Ag raph isf-choosable if for every collection of lists with list sizes specied by f there is a proper coloring using colors from… Expand

Is this relevant?

2001

2001

Consider the following game: Little cups are placed on certain squares of acheckerboard, and you are to throw into each cup a die… Expand

Is this relevant?

1997

1997

We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free… Expand

Is this relevant?

1995

1995

We present previously unpublished elementary proofs by Dekker and Ottens (1991) and Boyce (private communication) of a special… Expand

Is this relevant?

1995

1995

Fred Galvin's amazing proof of the Dinitiz conjecture is used to illustrate the method of undetermined generalization and… Expand

Is this relevant?

1993

1993

A loudspeaker enclosure, for a loudspeaker with a diaphragm, having a front wall, a mounting and spacing device for mounting the… Expand

Is this relevant?

1989

1989

Publisher Summary An r × n latin rectangle is an r × n array filled with m symbols, say, such that every cell contains one symbol… Expand

Is this relevant?