default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 8
Volume 8, Number 1, Spring 1984
- Ján Plesník:
On the sum of all distances in a graph or digraph. 1-21 - Carsten Thomassen:
Subdivisions of graphs with large minimum degree. 23-28 - Thomas W. Tucker:
On proulx's four exceptional toroidal groups. 29-33 - Joan P. Hutchinson:
Automorphism properties of embedded graphs. 35-49 - Vasek Chvátal:
Recognizing decomposable graphs. 51-53 - Peter J. Lorimer:
Vertex-transitive graphs: Symmetric graphs of prime valency. 55-68 - Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao:
Rotation numbers for unions of circuits. 69-81 - András Gyárfás, Cecil C. Rousseau, Richard H. Schelp:
An extremal problem for paths in bipartite graphs. 83-95 - C. W. Evans:
A second trivalent graph with 58 vertices and girth 9. 97-99 - Abdelhamid Benhocine:
On the existence of a specified cycle in digraphs with constraints on degrees. 101-107 - Cai Xiao-Tao:
A short proof for the Faudree-Schelp theorem on path-connected graphs. 109-110 - Walter Vogler:
Graphs with given group and given constant link. 111-115 - Nicholas C. Wormald:
Isomorphic factorizations VII. Regular graphs and tournaments. 117-122 - Mark K. Goldberg:
Edge-coloring of multigraphs: Recoloring technique. 123-137 - Manton M. Matthews, David P. Sumner:
Hamiltonian results in K1, 3-free graphs. 139-146 - Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and hamiitonian properties in the square of a connected graph. 147-154 - W. W. Wong, C. K. Wong:
Minimum K-hamiltonian graphs. 155-165 - Zbigniew Palka
:
On the number of vertices of given degree in a random graph. 167-170 - Miroslaw Truszczyáski:
Note on vertex degrees of planar graphs. 171-176 - Peter J. Lorimer:
The ramsey numbers for stripes and one complete graph. 177-184
- P. Himelwright, W. D. Wallis, J. E. Williamson:
On one-factorizations of compositions of graphs. 185-186
Volume 8, Number 2, Summer 1984
- Frank Harary, Robert W. Robinson:
The rediscovery of Redfield's papers. 191-193 - E. Keith Lloyd:
J. Howard Redfield 1879-1944. 195-203 - J. Howard Redfield:
Enumeration by frame group and range groups. 205-223 - J. I. Hall, Edgar M. Palmer, Robert W. Robinson:
Redfield's lost paper in a modern context. 225-240 - Paul D. Seymour, R. W. Weaver:
A generalization of chordal graphs. 241-251 - P. J. Owens:
Regular planar graphs with faces of only two types and shortness parameters. 253-275 - Richard Steinberg:
Tutte's 5-flow conjecture for the projective plane. 277-285 - Hikoe Enomoto:
Long paths and large cycles in finite graphs. 287-301 - Lane H. Clark:
On hamiltonian line graphs. 303-307 - Hikoe Enomoto, Bernard Péroche:
The linear arboricity of some regular graphs. 309-324 - Bohdan Zelinka:
On a problem of a. kotzig concerning factorizations of 4-regular graphs. 325-330 - Uri N. Peled, Bruno Simeone:
Box-threshold graphs. 331-345
Volume 8, Number 3
- S. V. Kanetkar, P. R. Rao:
Connected, locally 2-connected, K1, 3-free graphs are panconnected. 347-353 - Earl Glen Whitehead Jr., Lian-Chang Zhao:
Chromatic uniqueness and equivalence of K4 homeomorphs. 355-364 - B. Richter, H. Shank:
The cycle space of an embedded graph. 365-369 - Earl Glen Whitehead Jr., Lian-Chang Zhao:
Cutpoints and the chromatic polynomial. 371-377 - J. L. Brenner, R. C. Lyndon:
Doubly eulerian trails on rectangular grids. 379-385 - Dan Archdeacon:
Face colorings of embedded graphs. 387-398 - George R. T. Hendry:
The multiplicity of 1-factors in the square of a graph. 399-403 - Thomas Andreae, Rüdiger Schmidt:
On the reconstruction of rayless infinite forests. 405-422 - R. Balakrishnan, P. Paulraja:
Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs. 423-426 - William McCuaig:
A simple proof of Menger's theorem. 427-429 - Hiroshi Maehara:
A digraph represented by a family of boxes or spheres. 431-439
Volume 8, Number 4, Winter 1984
- András Gyárfás, János Komlós, Endre Szemerédi:
On the distribution of cycle lengths in graphs. 441-462 - Amanda G. Chetwynd, Anthony J. W. Hilton:
The chromatic index of graphs of even order with many edges. 463-470 - Yair Caro:
The decomposition of trees into subtrees. 471-479 - Helmut Prodinger:
On the altitude of specified nodes in random trees. 481-485 - Frank Boesch, Ralph Tindell:
Circulants and their connectivities. 487-499 - Hans-Jürgen Bandelt:
Retracts of hypercubes. 501-510 - F. R. K. Chung, M. R. Garey:
Diameter bounds for altered graphs. 511-534
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-02-21 19:35 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:
