174 search results - page 8 / 35 » On the First-Fit Chromatic Number of Graphs |
110
Voted
COMBINATORICS
2006
15 years 14 days ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
109
Voted
GC
2010
Springer
14 years 11 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
83
Voted
JGT
2011
14 years 7 months ago
2011
94
Voted
ENDM
2007
15 years 11 days ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
113
click to vote
CPC
2004
15 years 8 days ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...