17 search results - page 1 / 4 » On the minimum degree of minimal Ramsey graphs |
JGT
2010
13 years 9 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
SIAMDM
2010
13 years 5 months 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...
DAM
2008
13 years 11 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
TCS
2008
13 years 11 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
JCT
2006
13 years 11 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...