Join Our Newsletter

SIAMDM

2010

9 years 15 days ago
2010

Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...

SIAMDM

2010

9 years 15 days ago
2010

Abstract. The conjecture of Bollob

JGT

2010

9 years 16 days 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 ...

CORR

2010

Springer

9 years 21 days ago
2010

Springer

For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...

APPML

2011

9 years 24 days ago
2011

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...

COMBINATORICA

2010

9 years 3 months ago
2010

In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...

SIAMDM

2010

9 years 4 months ago
2010

Let s < t be two ﬁxed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...

JGT

2010

9 years 4 months ago
2010

In 1996, Ota and Tokuda showed that a star-free graph with suﬃciently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be ...

JGT

2010

9 years 4 months ago
2010

An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...

COMBINATORICS

1999

9 years 5 months ago
1999

It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...