JGT
2010
13 years 5 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
JGT
2010
13 years 5 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
JGT
2010
13 years 9 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
JGT
2010
13 years 9 months ago
2010
JGT
2010
13 years 9 months ago
2010
: We consider a problem related to Hadwiger’s Conjecture. Let
JGT
2010
13 years 9 months ago
2010
Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding ...
JGT
2010
13 years 9 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
JGT
2010
13 years 9 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
JGT
2010
13 years 9 months ago
2010
JGT
2010
13 years 9 months ago
2010
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether...