3204 search results - page 37 / 641 » The Alcuin Number of a Graph |
ENDM
2006
13 years 8 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
ENDM
2008
13 years 8 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
JCT
2007
13 years 7 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
PDP
2007
IEEE
14 years 2 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
DM
2007
13 years 8 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...