DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
DM
2008
13 years 11 months ago
2008
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
DM
2008
13 years 11 months ago
2008
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...