default search action
Journal of Graph Theory, Volume 7
Volume 7, Number 1, Spring 1983
- Frank Harary:
A tribute to Frank P. Ramsey, 1903-1930. 1-7 - D. H. Mellor:
The eponymous F. P. Ramsey. 9-13 - Joel Spencer:
Ramsey theory and Ramsey theoreticians. 15-23 - F. R. K. Chung, Charles M. Grinstead:
A survey of bounds for classical Ramsey numbers. 25-37 - Stefan A. Burr, Paul Erdös:
Generalizations of a Ramsey-theoretic result of chvátal. 39-51 - Ralph J. Faudree, J. Sheehan:
Size Ramsey numbers for small-order graphs. 53-55 - S. A. Burr:
Diagonal Ramsey numbers for small graphs. 57-69 - Ronald J. Gould, Michael S. Jacobson:
On the Ramsey number of trees versus graphs with large clique number. 71-78 - F. R. K. Chung:
On a Ramsey-type problem. 79-83 - Jerrold W. Grossman:
Graphs with unique Ramsey colorings. 85-90 - Noga Alon:
On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems. 91-94 - David W. Matula:
Ramsey theory for graph connectivity. 95-103 - Ronald L. Graham:
Euclidean Ramsey theorems on the n-sphere. 105-114 - József Beck:
On size Ramsey number of paths, trees, and circuits. I. 115-129 - András Gyárfás:
Vertex coverings by monochromatic paths and cycles. 131-135 - Paul Erdös, János Pach:
On a Quasi-Ramsey problem. 137-147 - Filip Guldan, Pavel Tomasta:
New lower bounds of some diagonal Ramsey numbers. 149-151
Volume 7, Number 2, Summer 1983
- Amanda G. Chetwynd, Robin J. Wilson:
The rise and fall of the critical graph conjecture. 153-157 - Lynn Margaret Batten:
Geodesic subgraphs. 159-163 - Carsten Thomassen:
Graph decomposition with constraints on the connectivity and minimum degree. 165-167 - Carsten Thomassen:
A theorem on paths in planar graphs. 169-176 - Terry A. McKee:
Series-parallel graphs: A logical approach. 177-181 - Béla Bollobás, Ove Frank, Michal Karonski:
On 4-cycles in random bipartite tournaments. 183-194 - Thom Grace:
On sequential labelings of graphs. 195-201 - Seymour Schuster:
Interpolation theorem for the number of end-vertices of spanning trees. 203-208 - Frank Harary, Peter Kovács:
Regular graphs with given girth pair. 209-218 - Edward M. Wright:
The number of connected sparsely edged graphs. IV large nonseparable graphs. 219-229 - Viera Krnanová Proulx:
On the genus of five- and six-regular graphs. 231-234 - Mao-Cheng Cai:
Arc-disjoint arborescences of digraphs. 235-240 - Fred C. Holroyd:
Enumeration of acyclic and unicyclic nets with four types of self-duality. 241-260 - Carsten Thomassen:
Graph decomposition with applications to subdivisions and path systems modulo k. 261-271
- John Frederick Fink:
Randomly antitraceable digraphs. 273
Volume 7, Number 3
- S. J. Quinn:
Isomorphic factorizations of complete equipartite graphs. 285-310 - Peter Kirschenhofer:
On the average shape of simply generated families of trees. 311-323 - Mohammed Abu-Sbeih, Torrence D. Parsons:
Embeddings of bipartite graphs. 325-334 - A. M. Dawes, John B. Florence:
Graph dismantling problems. 335-347 - D. H. Younger:
Integer flows. 349-357 - Katherine Heinrich:
Partitioning oriented 2-paths. 359-367 - Peter C. Fishburn:
Packing graphs with odd and even trees. 369-383
Volume 7, Number 4, Winter 1983
- Frank Harary:
In praise of paul erdös on his seventieth. 385-390 - András Hajnal, Vera T. Sós:
Paul Erdös is seventy. 391-393 - Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On Ramsey numbers involving starlike multipartite graphs. 395-409 - Paul Erdös, Edgar M. Palmer, Robert W. Robinson:
Local connectivity of a random graph. 411-417 - Gary Chartrand, S. F. Kapoor, E. A. Nordhaus:
Hamiltonian path graphs. 419-427 - Ioan Tomescu:
On Hamiltonian-connected regular graphs. 429-436 - Rudolf Halin:
On the notion of infinite Hamiltonian graph. 437-440 - Laurence E. Penn, David Witte:
When the cartesian product of two directed cycles is hypo-Hamiltonian. 441-443 - John H. Conway, Cameron McA. Gordon:
Knots and links in spatial graphs. 445-453 - Andries E. Brouwer:
The uniqueness of the strongly regular graph on 77 points. 455-461 - Robert W. Robinson, Nicholas C. Wormald:
Numbers of cubic graphs. 463-467 - Abdelhamid Benhocine, A. Pawel Wojda:
On the existence of specified cycles in a tournament. 469-473 - Svatopluk Poljak, Vojtech Rödl, Ales Pultr:
On a product dimension of bipartite graphs. 475-486 - Hans-Jürgen Bandelt, Henry Martyn Mulder:
Infinite median graphs, (0, 2)-graphs, and hypercubes. 487-497
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.