default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 4
Volume 4, Number 1, Spring 1980
- B. Devadas Acharya:
Spectral criterion for cycle balance in networks. 1-11 - Alexander K. Kelmans:
Concept of a vertex in a matroid and 3-connected graphs. 13-19 - Brad Jackson:
Triangular embeddings of K((i-2) n, n, ..., n). 21-30 - Tomaz Pisanski:
Genus of cartesian products of regular bipartite graphs. 31-42 - Klaus Truemper:
On Whitney's 2-isomorphism theorem for graphs. 43-49 - Richard A. Brualdi, Frank Harary, Zevi Miller:
Bigraphs versus digraphs via matrices. 51-73 - Andrzej Proskurowski:
Centers of maximal outerplanar graphs. 75-79 - David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
Conservative graphs. 81-91 - Curtis A. Barefoot, Roger C. Entringer:
Extremal maximal uniquely hamiltonian graphs. 93-100 - Luca Simoncini, Herbert Taylor:
Subgraphs smaller than the girth. 101-105 - Henry Martyn Mulder
:
n-cubes and median graphs. 107-110 - Peter Horák, Jozef Sirán:
Note on a new coloring number of a graph. 111-113 - H. Joseph Straight:
Note on the cochromatic number of several surfaces. 115-117
- Alexander K. Kelmans:
Graphs with an extremal number of spanning trees. 119-122
Volume 4, Number 2, Summer 1980
- Tadeusz Sozanski:
Enumeration of weak isomorphism classes of signed graphs. 127-144 - Lowell W. Beineke, Richard D. Ringeisen:
On the crossing numbers of products of cycles and graphs of order four. 145-155 - Peter Avery:
Condition for a tournament score sequence to be simple. 157-164 - Jonathan L. Gross, Samuel J. Lomonaco:
A determination of the toroidal k-metacyclic groups. 165-172 - J. I. Hall:
Locally petersen graphs. 173-187 - Alan Donald:
An upper bound for the path number of a graph. 189-201 - Ronald C. Read, Nicholas C. Wormald:
Number of labeled 4-regular graphs. 203-212 - Donald L. Goldsmith, Bennet Manvel, Vance Faber:
Separation of graphs into three components by the removal of edges. 213-218 - Douglas Bauer:
Line-graphical degree sequences. 219-232 - Gary Chartrand, Ronald J. Gould, Albert D. Polimeni:
On ramsey numbers of forests versus nearly complete graphs. 233-239 - Stefan A. Burr:
A ramsey-theoretic result involving chromatic numbers. 241-242 - Peter J. Cameron:
A note on generalized line graphs. 243-245 - Charles Delorme:
Two sets of graceful graphs. 247-250
Volume 4, Number 3, Fall 1980
- Jonathan L. Gross, Frank Harary:
Some problems in topological graph theory. 253-263 - Medha Javdekar:
Note on Choudum's "chromatic bounds for a class of graphs". 265-267 - Christina M. Mynhardt, Izak Broere:
G-constructibility of planar graphs. 269-278 - Krishnamurthy Vidyasankar:
Covers and strong covers in directed bipartite graphs. 279-286 - Tudor Zamfirescu:
Three small cubic graphs with interesting hamiltonian properties. 287-292 - Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
All triangle-graph ramsey numbers for connected graphs of order six. 293-300 - Timothy A. Sipka:
The orders of graphs with prescribed degree sets. 301-307 - Hian Poh Yap:
On the critical graph conjecture. 309-314 - Takao Asano, Takao Nishizeki, Takahiro Watanabe:
An upper bound on the length of a Hamiltonian walk of a maximal planar graph. 315-336 - Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Girth in digraphs. 337-341
Volume 4, Number 4, Winter 1980
- Stefan A. Burr, Vera Rosta:
On the Ramsey multiplicities of graphs - problems and recent results. 347-361 - Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. 363-370 - Stefano Fanelli:
On a conjecture on maximal planar sequences. 371-375 - Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi:
Hypotraceable digraphs. 377-381 - Fred Buckley:
A Ramsey property for graph invariants. 383-387 - Peter J. Slater:
Medians of arbitrary graphs. 389-392 - Edward M. Wright:
The number of connected sparsely edged graphs. III. Asymptotic results. 393-407 - Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. 409-415 - Ahmad Fawzi Alameddine:
On the number of cycles of length 4 in a maximal planar graph. 417-422 - Arthur T. White:
A note on conservative graphs. 423-425
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 2026-02-28 23:29 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:
