\HeaderA{sequential.vertex.coloring}{Compute a vertex coloring for a graph}{sequential.vertex.coloring}
\keyword{models}{sequential.vertex.coloring}
\begin{Description}\relax
Compute vertex coloring for a graph
\end{Description}
\begin{Usage}
\begin{verbatim}
sequential.vertex.coloring(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
A vertex coloring for a graph is to assign a color for each vertex so that no 
two adjacent vertices are of the same color.  We designate the colors as 
sequential integers: 1, 2, ....

For ordered vertices, \code{v1}, \code{v2}, ..., \code{vn}, for k = 1, 2, ..., 
n, this algorithm assigns \code{vk} to the smallest possible color.  It does 
NOT guarantee to use minimum number of colors.

See documentations on these algorithms in Boost Graph Library for more details.
\end{Details}
\begin{Value}
\begin{ldescription}
\item[\code{no. of colors needed}] how many colors to use to color the graph
\item[\code{colors of nodes}] 
\end{ldescription}
 { color label for each vertex }
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL"), open="r"))
sequential.vertex.coloring(coex)
\end{ExampleCode}
\end{Examples}

