You have Guest access.
Log In
F. R. K. Chung and P. Erdős
Journal Article
The diameter of random regular graphs
Béla Bollobás and W. Fernandez de la Vega
Combinatorica, 1982, Volume 2, Number 2, Pages 125-134
Codes based on complete graphs
Dieter Jungnickel, Marialuisa J. Resmini and Scott A. Vanstone
Designs, Codes and Cryptography, 1996, Volume 8, Numbers 1-2, Pages 159-165
On-line coloring of perfect graphs
H. A. Kierstead and K. Kolossa
Combinatorica, 1996, Volume 16, Number 4, Pages 479-491
Long paths and cycles in tough graphs
H. J. Broersma, J. van den Heuvel, H. A. Jung and H. J. Veldman
Graphs and Combinatorics, 1993, Volume 9, Number 1, Pages 3-17
Independent sets, cliques and hamiltonian graphs
Xin Liu
Graphs and Combinatorics, 1995, Volume 11, Number 3, Pages 267-273
Large holes in sparse random graphs
A. M. Frieze and B. Jackson
Combinatorica, 1987, Volume 7, Number 3, Pages 265-274
Book Chapter
Near-optimum Universal Graphs for Graphs with Bounded Degrees Extended Abstract
Noga Alon, Michael Capalbo, Yoshiharu Kohayakawa, Vojtěch Rödl and Andrzej Ruciński, et al.
Lecture Notes in Computer Science, 2001, Volume 2129, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, Pages 170-180
Shortest paths in euclidean graphs
Robert Sedgewick and Jeffrey Scott Vitter
Algorithmica, 1986, Volume 1, Numbers 1-4, Pages 31-48
On the number of homogeneous subgraphs of a graph
L. A. Székely
Combinatorica, 1984, Volume 4, Number 4, Pages 363-372
Degree sums,k-factors and hamilton cycles in graphs
R. J. Faudree and J. van den Heuvel
Graphs and Combinatorics, 1995, Volume 11, Number 1, Pages 21-28
AMS subject classification (1980) 05 C 35
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info