default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 2
Volume 2, Number 1, Spring 1978
- Michael O. Albertson, Joan P. Hutchinson:
On the independence ratio of a graph. 1-8 - Ján Plesník:
Bounds on chromatic numbers of multiple factors of a complete graph. 9-17 - Andreas Blass:
Graphs with unique maximal clumpings. 19-24 - Bennet Manvel, Joseph M. Weinstein:
Nearly acyclic graphs are reconstructible. 25-39 - Saul Stahl:
Generalized Embedding Schemes. 41-52 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On cycle - Complete graph ramsey numbers. 53-64 - Joseph B. Klerlein:
Hamiltonian cycles in cayley color graphs. 65-68 - Mark Jungerman, Gerhard Ringel:
The genus of the n-octahedron: Regular cases. 69-75 - Cecil C. Rousseau, J. Sheehan:
On ramsey numbers for books. 77-87 - Peter J. Lorimer, R. J. Segedin:
Ramsey numbers for multiple copies of complete graphs. 89-91
- Michael Capobianco, John C. Molluzzo:
Examples and Counterexamples in Graph Theory. 92
Volume 2, Number 2, Summer 1978
- Stanley Fiorini:
A bibliographic survey of edge-colorings. 93-106 - James M. Benedict, Gary Chartrand, Don R. Lick:
Mixed ramsey numbers: Chromatic numbers versus graphs. 107-118 - Ralph J. Faudree, Richard H. Schelp:
Some connected ramsey numbers. 119-128 - Paul Erdös, Arthur M. Hobbs:
A class of Hamiltonian regular graphs. 129-135 - William T. Trotter, Paul Erdös:
When the cartesian product of directed cycles is Hamiltonian. 137-142 - Keith R. Matthews
:
On the eulericity of a graph. 143-148 - Thomas Andreae:
Matroidal families of finite connected nonhomeomorphic graphs exist. 149-153 - Martin Charles Golumbic, Clinton F. Goss:
Perfect Elimination and Chordal Bipartite Graphs. 155-163 - Paul A. Catlin:
Graph Decompositions Satisfying Extremal Degree Constraints. 165-170 - Jonathan L. Gross:
An infinite family of octahedral crossing numbers. 171-178
Volume 2, Number 3, Fall 1978
- Paul C. Kainen, Arthur T. White:
On stable crossing numbers. 181-187 - Nicholas C. Wormald:
Achiral plane trees. 189-208 - Peter J. Slater:
Centers to centroids in graphs. 209-222 - Dennis P. Geoffroy, David P. Sumner:
An upper bound on the size of a largest clique in a graph. 223-230 - Ian Anderson, Arthur T. White:
Current graphs and bi-embeddings. 231-239 - Brian Alspach, K. B. Reid:
Degree frequencies in digraphs and tournaments. 241-249 - Ladislav Nebesky:
Some sufficient conditions for the existence of a 1-factor. 251-255 - Peter O'Neil:
A new proof of menger's theorem. 257-259 - Stanley Fiorini:
Counterexamples to two conjectures of Hilton. 261-264 - James R. Walter:
Representations of chordal graphs as subtrees of a tree. 265-267 - Viera Krnanová Proulx:
Classification of the toroidal groups. 269-273
- Michael Capobianco, John C. Molluzzo:
Examples and counterexamples in graph theory. 274
Volume 2, Number 4, Winter 1978
- Saul Stahl:
The embeddings of a graph - A survey. 275-298 - Edward M. Wright:
The number of connected sparsely edged graphs. II. Smooth graphs and blocks. 299-305 - Seifollah Louis Hakimi, Edward F. Schmeichel:
On the connectivity of maximal planar graphs. 307-314 - Steve Wilson:
The smallest nontoroidal chiral maps. 315-318 - Roger C. Entringer:
Characterization of maximum critically 2-connected graphs. 319-327 - Walter D. Wallis, Katherine Heinrich:
Graphs with symmetric automorphism group. 329-336 - Torrence D. Parsons:
Paths extendable to cycles. 337-339 - Carsten Thomassen:
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs. 341-347 - Chong-Keang Lim:
On supercompact graphs. 349-355
- Roger H. Lamprey:
Diameter of the conjunction of two finite graphs. 357-362 - Bill Jackson:
Hamilton cycles in regular graphs. 363-365
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.
last updated on 2025-11-14 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
