31 search results - page 2 / 7 » H-Free Graphs of Large Minimum Degree |
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
JCT
2008
13 years 7 months ago
2008
A conjecture by Bollob
SIAMDM
2010
13 years 5 months ago
2010
Let s < t be two fixed 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...
JCT
2006
13 years 7 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
SIAMDM
2010
13 years 2 months ago
2010
Abstract. The conjecture of Bollob