Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 1
Volume 1, Number 1, Spring 1977
- Frank Harary, Gary Chartrand:
Editorial. 1-2
- Paul Erdös:
A note of welcome. 3 - George Pólya:
A note of welcome. 5 - Paul Turán:
A note of welcome. 7-9 - Edward Wright:
A note of welcome. 11-12
- Crispin St. John Alvah Nash-Williams, W. T. Tutte:
More proofs of menger's theorem. 13-17 - Paul K. Stockmeyer:
The falsity of the reconstruction conjecture for tournaments. 19-25 - Linda M. Lesniak-Foster:
Some recent results in hamiltonian graphs. 27-36 - John Sheehan:
Graphs with exactly one hamiltonian circuit. 37-43 - Roberto W. Frucht:
A canonical representation of trivalent hamiltonian graphs. 45-60 - A. J. W. Helton:
Definitions of criticality with respect to edge-coloring. 61-68 - Ladislav Nebesky:
On induced subgraphs of a block. 69-74 - Saul Stahl, Lowell W. Beineke:
Blocks and the nonorientable genus of graphs. 75-78 - Francis T. Boesch, Charles L. Suffel, Ralph Tindell:
The spanning subgraphs of eulerian graphs. 79-84 - Ronald L. Graham, Alan J. Hoffman, H. Hosoya:
On the distance matrix of a directed graph. 85-88 - M. Clancy:
Some small ramsey numbers. 89-91 - Vasek Chvátal:
Tree-complete graph ramsey numbers. 93
Volume 1, Number 2, Summer 1977
- Paul Erdös:
Paul Turán, 1910-1976: His work in graph theory. 97-101 - Miklós Simonovits:
On paul turán's influence on graph theory. 102-116 - Béla Bollobás:
Extremal problems in graph theory. 117-123 - László Babai
:
Some applications of graph contractions. 125-130 - Frank Harary, Derbiau Hsu, Zevi Miller:
The biparticity of a graph. 131-133 - Yousef Alavi, M. Behzad, Linda M. Lesniak-Foster, E. A. Nordhaus:
Total matchings and total coverings of graphs. 135-140 - Gerhard Ringel:
The combinatorial map color theorem. 141-155 - Amram Meir, John W. Moon:
Packing and covering constants for certain families of trees. I. 157-174 - Gerald Berman:
Frequently cited publications in pure graph theory. 175-180 - P. R. Goodey:
A class of Hamiltonian polytopes. 181-185
- Frank Harary, Robert W. Robinson, Nicholas C. Wormald:
The divisibility theorem for isomorphic factorizations of complete graphs. 187-188 - Robert W. Robinson:
Counting strong digraphs. 189-190
Volume 1, Number 3, Fall 1977
- Wolfgang Haken:
An attempt to understand the four color problem. 193-206 - Frank R. Bernhart:
A digest of the four color theorem. 207-225 - J. Adrian Bondy, Robert L. Hemminger:
Graph reconstruction - a survey. 227-268 - Ruth A. Bari, Dick Wick Hall:
Chromatic polynomials and whitney's broken circuits. 269-275 - David Burns, Seymour Schuster:
Every (p, p-2) graph is contained in its complement. 277-279 - Brendan D. McKay:
Computer reconstruction of small graphs. 281-283
- Robert W. Robinson:
Counting cubic graphs. 285-286
Volume 1, Number 4, Winter 1977
- Frank Harary:
Homage to george pólya. 289-290 - Albert Pfluger:
George Pólya. 291-294 - Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk:
Enumeration of graphs with signed points and lines. 295-308 - Edgar M. Palmer, Allen J. Schwenk:
The number of self-complementary achiral necklaces. 309-315 - Edward M. Wright:
The number of connected sparsely edged graphs. 317-330 - P. M. D. Gray, A. M. Murray, N. A. Young:
Wright's formulae for the number of connected sparsely edged graphs. 331-334 - Stephen T. Hedetniemi, Diane M. Spresser:
A property of trees in terms of unique connected subgraphs. 335-337 - Ronald C. Read, Derek G. Corneil:
The graph isomorphism disease. 339-363 - Robert L. Hemminger, Joseph B. Klerlein:
Line pseudodigraphs. 365-377 - S. Rao Kosaraju:
On independent circuits of a digraph. 379-382
- Nicholas C. Wormald:
Counting labelled 3-connected graphs. 383-384
a service of 
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 2023-12-11 21:26 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:
