choosability
Look at other dictionaries:
List coloring — 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, first studied by Vizing [1] and by Erdős, Rubin, and Taylor.[2][3][4] … Wikipedia
List edge-coloring — In mathematics, list edge coloring is a type of graph coloring.More precisely, a list edge coloring is a choice function that maps every edge to a color from a prescribed list for that edge.A graph is k edge choosable if it has a proper list edge … Wikipedia
Total coloring — [ Proper total coloring of Foster Cage with 6 colors. The total chromatic number of this graph is 6 sincethe degree of each vertex is 5 (5 adjacent edges + 1 vertex=6).] In graph theory, total coloring is a type of coloring on the vertices and… … Wikipedia
Arthur Rubin — Arthur Leonard Rubin (born 1956) is an American mathematician who has earned a place among the five top ranked undergraduate competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times… … Wikipedia
