Searching for "Choice numbers of graphs" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Choice numbers of graphs; a probabilistic approach
- …Choice numbers of graphs; a probabilistic approach Noga Alon ∗ Department of Mathematics Raymond…
- Cited by 14 (5 self) – Add To MetaCart
-
Some results on (a: b)-choosability
- … bound for the k th choice number of a graph is given. We also prove that a directed graph with maximum…
- Add To MetaCart
-
Dirac's Map-Color Theorem for Choosability
- … that the choice number of every graph G embedded on a surface of Euler genus " 1 and " 6= 3 is at most…
- Cited by 9 (5 self) – Add To MetaCart
-
Edge Colorings And Total Colorings Of Integer Distance Graphs
- … choice number of all integer distance graphs, and the choice number of special integer distance graphs. 1…
- Cited by 1 (1 self) – Add To MetaCart
-
COLORING AND LABELING PROBLEMS ON GRAPHS BY
- …-list-colorable. We also call the list chromatic number the choice number of the graph. If a graph is k…
- Add To MetaCart
-
Restricted colorings of graphs
- … number χ(G) of G. The choice number of the line graph of G, which we denote here by ch ′ (G), is usually…
- Cited by 53 (12 self) – Add To MetaCart
-
Fault Tolerant Algorithms for Orderings and Colorings
- … the choice number of the graph [12], and is denoted choice(G). Clearly, χ(G) ≤ choice(G). Itiseasytoshow…
- Cited by 2 (2 self) – Add To MetaCart
Showing 1 through 7.
