default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 3
Volume 3, Number 1, Spring 1979
- Richard D. Ringeisen:
Survey of results on the maximum genus of a graph. 1-13 - Guy Chaty, Michel Chein:
Minimally 2-edge connected graphs. 15-22 - Anton Kotzig:
1-Factorizations of cartesian products of regular graphs. 23-34 - Pavol Hell, Louis V. Quintas:
An intermediate value theorem for graphs with given automorphism group. 35-41 - H. Joseph Straight:
Cochromatic Number and the Genus of a Graph. 43-51 - Brian L. Garman:
Voltage graph embeddings and the associated block designs. 53-67 - Seifollah Louis Hakimi, Edward F. Schmeichel:
On the number of cycles of length k in a maximal planar graph. 69-86 - V. R. Kulli, D. G. Akka, Lowell W. Beineke:
On Line Graphs with Crossing Number 1. 87-90 - François Jaeger:
A Note on Sub-Eulerian Graphs. 91-93
Volume 3, Number 2, Summer 1979
- Georg Gati:
Further annotated bibliography on the isomorphism disease. 95-109 - Marg Kropar, Ronald C. Read:
On the construction of the self-complementary graphs on 12 nodes. 111-125 - John Riordan:
Forests of label-increasing trees. 127-133 - Paul H. Edelman
, Michael E. Saks:
Group labelings of graphs. 135-140 - Kenneth A. Berman:
Spanning arborescences, ingraphs, and outgraphs. 141-150 - Aram Kevorkian:
Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. 151-174 - Dominique de Werra:
On the use of alternating chains and hypergraphs in edge coloring. 175-182 - David P. Summer:
Randomly matchable graphs. 183-186 - Charles J. Colbourn, Ronald C. Read:
Orderly algorithms for generating restricted classes of graphs. 187-195 - Jo Ann W. Staples:
On some subclasses of well-covered graphs. 197-204
Volume 3, Number 3, Fall 1979
- William T. Trotter, Frank Harary:
On double and multiple interval graphs. 205-211 - Martin Grötschel:
On minimal strong blocks. 213-219 - Martin Grötschel, Frank Harary:
The graphs for which all strong orientations are hamiltonian. 221-223 - Andreas Blass, Frank Harary:
Properties of almost all graphs and complexes. 225-240 - Béla Bollobás, Ernest J. Cockayne:
Graph-theoretic parameters concerning domination, independence, and irredundance. 241-249 - Donald L. Goldsmith, Roger C. Entringer:
A sufficient condition for equality of edge-connectivity and minimum degree of a graph. 251-255 - Kim T. Rawlinson, Roger C. Entringer:
Class of graphs with restricted neighborhoods. 257-262 - Ian Anderson:
Infinite families of biembedding numbers. 263-268 - Josef Lauri:
Edge-reconstruction of planar graphs with minimum valency 5. 269-286 - C. R. J. Clapham:
A class of self-complementary graphs and lower bounds of some ramsey numbers. 287-289 - Kenneth A. Berman, H. Shank:
Full 4-colorings of 4-regular maps. 291-294 - Phil Hanlon:
Enumeration of graphs by degree sequence. 295-299 - László Babai:
Long cycles in vertex-transitive graphs. 301-304 - Ira M. Gessel:
Tournaments and Vandermond's determinant. 305-307 - William R. Pulleyblank:
A note on graphs spanned by Eulerian graphs. 309-310
Volume 3, Number 4, Winter 1979
- Dragos M. Cvetkovic, Slobodan K. Simic:
A bibliography of graph equations. 311-324 - Charles C. Lindner, Eric Mendelsohn, Nathan Saul Mendelsohn, Barry Wolk:
Orthogonal latin square graphs. 325-338 - Richard J. Nowakowski, Ivan Rival:
Fixed-edge theorem for graphs with loops. 339-350 - David J. Oberly, Slobodan K. Simic, David P. Sumner:
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. 351-356 - Paolo Manca:
Generating all planer graphs regular of degree four. 357-364 - Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen:
On the number of hamiltonian cycles in a maximal planar graph. 365-370 - Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen:
Three-regular subgraphs of four-regular graphs. 371-386 - François Jaeger, Charles Payan, Nguyen Huy Xuong:
A class of upper-embeddable graphs. 387-391 - Douglas Bauer, Ralph Tindell:
Graphs with prescribed connectivity and line graph connectivity. 393-395 - David Avis:
On minimal 5-chromatic triangle-free graphs. 397-400 - D. J. Shoesmith, T. J. Smiley:
Theorem on directed graphs, applicable to logic. 401-406 - Pak-Ken Wong:
On the uniqueness of the smallest graph of girth 5 and valency 6. 407-409
- Aram Kevorkian:
Erratum: Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. 411
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 2024-12-31 21:47 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:
