Forbidden subgraphs that imply 2-factors | 10 | 0.74 | 2008 |
Forbidden subgraphs that imply k-ordered and k-ordered Hamiltonian | 7 | 0.66 | 2002 |
Forbidden subgraphs that imply k-ordered and k-ordered Hamiltonian | 7 | 0.66 | 2002 |
Characterizing forbidden clawless triples implying hamiltonian graphs | 11 | 1.38 | 2002 |
Random induced graphs | 1 | 0.35 | 2002 |
Edge disjoint monochromatic triangles in 2-colored graphs | 8 | 0.93 | 2001 |
The number of cycle lengths in graphs of given minimum degree and girth | 4 | 0.48 | 1999 |
The maximum number of edges in a graph with fixed edge-degree | 0 | 0.34 | 1998 |
An edge coloring problem for graph products | 0 | 0.34 | 1996 |
Graph spectra | 1 | 0.44 | 1996 |
Degree conditions and cycle extendability | 3 | 0.69 | 1995 |
A local density condition for triangles | 10 | 1.19 | 1994 |
On the rotation distance of graphs | 4 | 0.89 | 1994 |
Rainbow coloring the cube | 4 | 0.56 | 1993 |
Decomposition Of Bipartite Graphs Under Degree Constraints | 1 | 0.35 | 1993 |
Extremal problems involving vertices and edges on odd cycles | 2 | 0.37 | 1992 |
On independent generalized degrees and independence numbers in K(1, m-free graphs | 8 | 1.04 | 1992 |
Generalized degrees and Menger path systems | 2 | 0.59 | 1992 |
Neighborhood unions and a generalization of Dirac's theorem | 7 | 1.29 | 1992 |
Neighborhood conditions and edge-disjoint perfect matchings | 1 | 0.38 | 1991 |
Irregularity strength of dense graphs | 4 | 1.67 | 1991 |
Extremal theory and bipartite graph-tree Ramsey numbers | 1 | 0.43 | 1988 |
Small order graph-tree Ramsey numbers | 2 | 0.73 | 1988 |
Goodness of trees for generalized books | 8 | 1.98 | 1987 |
A Ramsey problem of Harary on graphs with prescribed size | 9 | 1.78 | 1987 |
Some intersection theorems on two-valued functions | 7 | 4.72 | 1986 |
Multipartite graph-sparse gra^j Ramsey numbers | 9 | 1.60 | 1985 |
Size Ramsey numbers for small-order graphs | 5 | 4.52 | 1983 |
On Ramsey numbers involving starlike multipartite graphs | 4 | 1.16 | 1983 |
All triangle-graph ramsey numbers for connected graphs of order six. | 7 | 2.09 | 1980 |
On cycle - Complete graph ramsey numbers. | 27 | 3.47 | 1978 |
Some connected ramsey numbers. | 0 | 0.34 | 1978 |