DM
2010
13 years 11 months ago
2010
The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r -1 contains at least r vertex-disjoint directed cycles. Thoma...
DM
2010
13 years 11 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
DM
2010
13 years 11 months ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
DM
2010
13 years 11 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
The Majority game is played by a questioner (Q) and an answerer (A). A holds